Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/1432| Title: | Explainable positive unlabeled learning for large sparse data |
| Authors: | Singh, Deepak Kumar, Vibhor (Advisor) |
| Keywords: | Algorithms PUDI Algorithm |
| Issue Date: | 22-Nov-2023 |
| Publisher: | IIIT-Delhi |
| Abstract: | There are scenarios in machine learning problems when the available class is only positive, and the rest of the data points are unlabelled. In our current approach, for a given disease-gene set, given members of the gene set are positive data points labeled as disease genes, but there are no true negative genes that can be said as non-disease genes unless empirically proven. Thus, this setup presents a positive-unlabelled problem, where the goal is to find more number of positive data points (disease genes in our context) without labels for negative data points. Our method performs well on sparse features and a small set of positive data points. |
| URI: | http://repository.iiitd.edu.in/xmlui/handle/123456789/1432 |
| Appears in Collections: | Year-2023 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BTP_report - Deepak Singh.pdf Restricted Access | 197.42 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.