IIIT-Delhi Institutional Repository

Explainable positive unlabeled learning for large sparse data

Show simple item record

dc.contributor.author Singh, Deepak
dc.contributor.author Kumar, Vibhor (Advisor)
dc.date.accessioned 2024-05-10T14:16:05Z
dc.date.available 2024-05-10T14:16:05Z
dc.date.issued 2023-11-22
dc.identifier.uri http://repository.iiitd.edu.in/xmlui/handle/123456789/1432
dc.description.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. en_US
dc.language.iso en_US en_US
dc.publisher IIIT-Delhi en_US
dc.subject Algorithms en_US
dc.subject PUDI Algorithm en_US
dc.title Explainable positive unlabeled learning for large sparse data en_US
dc.type Other en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


Advanced Search

Browse

My Account