Graph-Based Semisupervised Learning
Authors:
- Mark CulpMCMark Culp
- George MichailidisGMGeorge Michailidis
- 21 November 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 30 (1) , 174-179
Abstract
Graph-based learning provides a useful approach for modeling data in classification problems. In this modeling scenario, the relationship between labeled and unlabeled data impacts the construction and performance of classifiers and, therefore, a semisupervised learning framework is adopted. We propose a graph classifier based on kernel smoothing. A regularization framework is also introduced and it is shown that the proposed classifier optimizes certain loss functions. Its performance is assessed on several synthetic and real benchmark data sets with good results, especially in settings where only a small fraction of the data are labeled.Keywords
This publication has 5 references indexed in Scilit:
- Prediction on a Graph with a Perceptron2007
- Tikhonov regularization and semi-supervised learning on large graphs2004
- Understanding the Yarowsky AlgorithmComputational Linguistics, 2004
- Regularization and Semi-supervised Learning on Large Graphs2004
- Combining labeled and unlabeled data with co-training1998