A General Graph-Based Semi-Supervised Learning with Novel Class Discovery
View Researcher II's Other CodesDisclaimer: “The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).”
Please contact us in case of a broken link from here
Authors | Feiping Nie, Shiming Xiang, Yun Liu, Changshui Zhang |
Journal/Conference Name | Neural Computing Applications (NCA) |
Paper Category | Computer Science |
Paper Abstract | In this paper, we propose a general graph-based semi-supervised learning algorithm. The core idea of our algorithm is to not only achieve the goal of semi-supervised learning, but also to discover the latent novel class in the data, which may be unlabeled by the user. Based on the normalized weights evaluated on data graph, our algorithm is able to output the probabilities of data points belonging to the labeled classes or the novel class. We also give the theoretical interpretations for the algorithm from three viewpoints on graph, i.e., regularization framework, label propagation, and Markov random walks. Experiments on toy examples and several benchmark datasets illustrate the effectiveness of our algorithm. |
Date of publication | 2010 |
Code Programming Language | MATLAB |
Comment |