Instance selection method for improving graph-based semi-supervised learning

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

Abstract

Graph-based semi-supervised learning (GSSL) is one of the most important semi-supervised learning (SSL) paradigms. Though GSSL methods are helpful in many situations, they may hurt performance when using unlabeled data. In this paper, we propose a new GSSL method GsslIs based on instance selection in order to reduce the chances of performance degeneration. Our basic idea is that given a set of unlabeled instances, it is not the best to exploit all the unlabeled instances; instead, we should exploit the unlabeled instances which are highly possible to help improve the performance, while do not take the ones with high risk into account. Experiments on a board range of data sets show that the chance of performance degeneration of our proposal is much smaller than that of many state-of-the-art GSSL methods.

Cite

CITATION STYLE

APA

Wang, H., Wang, S. B., & Li, Y. F. (2016). Instance selection method for improving graph-based semi-supervised learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9810 LNCS, pp. 565–573). Springer Verlag. https://doi.org/10.1007/978-3-319-42911-3_47

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