Name
Abstract | ||
|---|---|---|
Positive unlabeled (PU) learning is useful in various practical situations, where there is a need to learn a classifier for a class of interest from an unlabeled data set, which may contain anomalies as well as samples from unknown classes. The learning task can be formulated as an optimization problem under the framework of statistical learning theory. Recent studies have theoretically analyzed its properties and generalization performance, nevertheless, little effort has been made to consider the problem of scalability, especially when large sets of unlabeled data are available. In this work we propose a novel scalable PU learning algorithm that is theoretically proven to provide the optimal solution, while showing superior computational and memory performance. Experimental evaluation confirms the theoretical evidence and shows that the proposed method can be successfully applied to a large variety of real-world problems involving PU learning. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TPAMI.2018.2860995 | IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE |
Keywords | Field | DocType |
Machine learning, one-class classification, positive unlabeled learning, open set recognition, kernel methods | Statistical learning theory,Semi-supervised learning,Stability (learning theory),Task analysis,Computer science,Unsupervised learning,Artificial intelligence,Classifier (linguistics),Optimization problem,Machine learning,Scalability | Journal |
Volume | Issue | ISSN |
41 | 11 | 0162-8828 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emanuele Sansone | 1 | 10 | 2.74 |
| Francesco GB De Natale | 2 | 0 | 0.34 |
| Zhi-Hua Zhou | 3 | 13480 | 569.92 |