Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/1432
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSingh, Deepak-
dc.contributor.authorKumar, Vibhor (Advisor)-
dc.date.accessioned2024-05-10T14:16:05Z-
dc.date.available2024-05-10T14:16:05Z-
dc.date.issued2023-11-22-
dc.identifier.urihttp://repository.iiitd.edu.in/xmlui/handle/123456789/1432-
dc.description.abstractThere 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.isoen_USen_US
dc.publisherIIIT-Delhien_US
dc.subjectAlgorithmsen_US
dc.subjectPUDI Algorithmen_US
dc.titleExplainable positive unlabeled learning for large sparse dataen_US
dc.typeOtheren_US
Appears in Collections:Year-2023

Files in This Item:
File Description SizeFormat 
BTP_report - Deepak Singh.pdf
  Restricted Access
197.42 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.