Name
Abstract | ||
|---|---|---|
Multi-label learning is an effective framework for learning with objects that have multiple semantic labels, and has been successfully applied into many real-world tasks. In contrast with traditional single-label learning, the cost of labeling a multi-label example is rather high, thus it becomes an important task to train an effectivemulti-label learning model with as few labeled examples as possible. Active learning, which actively selects the most valuable data to query their labels, is the most important approach to reduce labeling cost. In this paper, we propose a novel approach MADM for batch mode multi-label active learning. On one hand, MADM exploits representativeness and diversity in both the feature and label space by matching the distribution between labeled and unlabeled data. On the other hand, it tends to query predicted positive instances, which are expected to be more informative than negative ones. Experiments on benchmark datasets demonstrate that the proposed approach can reduce the labeling cost significantly. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s11704-016-5421-x | Frontiers of Computer Science |
Keywords | Field | DocType |
multi-label learning,batch mode active learning,distribution matching | Online machine learning,Competitive learning,Instance-based learning,Multi-task learning,Semi-supervised learning,Stability (learning theory),Active learning (machine learning),Pattern recognition,Computer science,Unsupervised learning,Artificial intelligence,Machine learning | Journal |
Volume | Issue | ISSN |
10 | 5 | 2095-2228 |
Citations | PageRank | References |
11 | 0.48 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nengneng Gao | 1 | 11 | 0.48 |
| Sheng-Jun Huang | 2 | 475 | 27.21 |
| Songcan Chen | 3 | 4148 | 191.89 |