JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A Label Inference Algorithm Considering Vertex Importance in Semi-Supervised Learning
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
  • Journal title : Journal of KIISE
  • Volume 42, Issue 12,  2015, pp.1561-1567
  • Publisher : Korean Institute of Information Scientists and Engineers
  • DOI : 10.5626/JOK.2015.42.12.1561
 Title & Authors
A Label Inference Algorithm Considering Vertex Importance in Semi-Supervised Learning
Oh, Byonghwa; Yang, Jihoon; Lee, Hyun-Jin;
 
 Abstract
Abstract Semi-supervised learning is an area in machine learning that employs both labeled and unlabeled data in order to train a model and has the potential to improve prediction performance compared to supervised learning. Graph-based semi-supervised learning has recently come into focus with two phases: graph construction, which converts the input data into a graph, and label inference, which predicts the appropriate labels for unlabeled data using the constructed graph. The inference is based on the smoothness assumption feature of semi-supervised learning. In this study, we propose an enhanced label inference algorithm by incorporating the importance of each vertex. In addition, we prove the convergence of the suggested algorithm and verify its excellence.
 Keywords
graph-based semi-supervised learning;label inference;Neumann series;vertex importance;
 Language
Korean
 Cited by
 References
1.
A. Subramanya and P. P. Talukdar, Graph-Based Semi-Supervised Learning, p.111, Morgan & Claypool, 2014.

2.
D. Kim, J. G. Joung, K. A. Sohn, H. Shin, Y. R. Park, M. D. Ritchie and J. H. Kim, "Knowledge boosting: a graph-based integration approach with multi-omics data and genomic knowledge for cancer clinical outcome prediction," Journal of the American Medical Informatics Association, Vol. 22, No. 1, pp. 109-120, 2015.

3.
K. Park and H. Shin, "Stock price prediction based on a complex interrelation network of economic factors," Engineering Applications of Artificial Intelligence, Vol. 26, No. 5, pp. 1550-1561, 2013. crossref(new window)

4.
O. Chapelle, B. Schölkopf and A Zien. Semi-Supervised Learning, p.508, Cambridge: MIT Press, 2006.

5.
X. Zhu, Z. Ghahramani and J. Lafferty. "Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions," Proc. of the 20th International Conference on Machine Learning, pp. 912-919, 2003.

6.
X. Zhu and A. B. Goldberg. Introduction to Semi-Supervised Learning, p.116, Morgan & Claypool, 2009.

7.
D. Zhou, O. Bousquet, T. N. Lal, J. Wetson and B. Scholkopf, "Learning with Local and Global Consistency," Advances in Neural Information Processing Systems, Vol. 16, pp. 321-328, 2004.

8.
B. Dalvi, W. W. Cohen and J. Callan, "Exploratory Learning," Machine Learning and Knowledge Discovery in Databases, Springer Berlin Heidelberg, pp. 128-143, 2013.

9.
J. Lin, "Divergence Measures Based on the Shannon Entropy," IEEE Transactions on Information Theory, Vol. 37, No. 1, pp. 145-151, 1991. crossref(new window)

10.
R. E. Fan, P. H. Chen and C. J. Lin, "Working Set Selection Using Second Order Information for Training Support Vector Machines," Journal of Machine Learning Research, Vol. 6, pp. 1889-1918, 2005.

11.
Y. Fang, K. C. C. Chang and H. W. Lauw. "Graphbased Semi-supervised Learning: Realizing Pointwise Smoothness Probabilistically," Proc. of the 20th International Conference on Machine Learning, 2014.