Graph-based active learning based on label propagation

21Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.
Get full text

Abstract

By only selecting the most informative instances for labeling, active learning could reduce the labeling cost when labeled instances are hard to obtain. Facing the same situation, semi-supervised learning utilize unlabeled instances to strengthen classifiers trained on labeled instances under suitable assumptions. However, the current active learning methods often ignore such effect. Combining semi-supervised learning, we propose a graph-based active learning method, which can also handle multi-class problems, in the entropy reduction framework. The proposed method trains the base classifier using a popular graph-based semi-supervised label propagation method and samples the instance with the largest expected entropy reduction for labeling. The experiments show that the proposed method outperforms the traditional sampling methods on selected datasets. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Long, J., Yin, J., Zhao, W., & Zhu, E. (2008). Graph-based active learning based on label propagation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5285 LNAI, pp. 179–190). Springer Verlag. https://doi.org/10.1007/978-3-540-88269-5_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free