Publications
Detailed Information
Accurate Graph-Based PU Learning without Class Prior
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yoo, Jaemin | - |
dc.contributor.author | Kim, Junghun | - |
dc.contributor.author | Yoon, Hoyoung | - |
dc.contributor.author | Kim, Geonsoo | - |
dc.contributor.author | Jang, Changwon | - |
dc.contributor.author | Kang, U | - |
dc.date.accessioned | 2022-06-24T00:26:18Z | - |
dc.date.available | 2022-06-24T00:26:18Z | - |
dc.date.created | 2022-05-09 | - |
dc.date.issued | 2021-01 | - |
dc.identifier.citation | Proceedings - IEEE International Conference on Data Mining, ICDM, Vol.2021-December, pp.827-836 | - |
dc.identifier.issn | 1550-4786 | - |
dc.identifier.uri | https://hdl.handle.net/10371/183764 | - |
dc.description.abstract | © 2021 IEEE.How can we classify graph-structured data only with positive labels? Graph-based positive-unlabeled (PU) learning is to train a binary classifier given only the positive labels when the relationship between examples is given as a graph. The problem is of great importance for various tasks such as detecting malicious accounts in a social network, which are difficult to be modeled by supervised learning when the true negative labels are absent. Previous works for graph-based PU learning assume that the prior distribution of positive nodes is known in advance, which is not true in many real-world cases. In this work, we propose GRAB (Graph-based Risk minimization with iterAtive Belief propagation), a novel end-to-end approach for graph-based PU learning that requires no class prior. GRAB models a given graph as a Markov network and runs the marginalization and update steps iteratively. The marginalization step estimates the marginals of latent variables, while the update step trains a classifier network utilizing the computed priors in the objective function. Extensive experiments on five datasets show that GRAB achieves state-of-the-art accuracy, even compared with previous methods that are given the true prior. | - |
dc.language | 영어 | - |
dc.publisher | IEEE | - |
dc.title | Accurate Graph-Based PU Learning without Class Prior | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/ICDM51629.2021.00094 | - |
dc.citation.journaltitle | Proceedings - IEEE International Conference on Data Mining, ICDM | - |
dc.identifier.wosid | 000780454100084 | - |
dc.identifier.scopusid | 2-s2.0-85125184239 | - |
dc.citation.endpage | 836 | - |
dc.citation.startpage | 827 | - |
dc.citation.volume | 2021-December | - |
dc.description.isOpenAccess | N | - |
dc.contributor.affiliatedAuthor | Kang, U | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.