Abstract
Graph-based semi-supervised learning has attracted much attention in recent years. Many successful methods rely on graph structure to propagate labels from labeled data to unlabeled data. Although graph structure affects the performance of the system, only few works address its construction problem. In this work, the graph structure is constructed by adjusting the hyperparameter controlling the connection weights between nodes. The idea is to learn the hyperparameters for graphs that yields low leave-one-out prediction error on labeled data while retaining high stability of the prediction on unlabeled data. The problem is solved efficiently using the gradient-based optimization technique. Experimental results indicate that the proposed technique yields improvement of generalization error as well as stability of the labeling function.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Zhu, X., Ghahramani, Z.: Learning from labeled and unlabeled data with label propagation. Technical report, Carnegie Mellon University (2002)
Blum, A., Chawla, S.: Learning from labeled and unlabeled data using graph mincuts. In: Brodley, C.E., Danyluk, A.P., Brodley, C.E., Danyluk, A.P. (eds.) ICML, pp. 19–26. Morgan Kaufmann, San Francisco (2001)
Blum, A., La, J., Rwebangira, M., Reddy, R.: Semi-supervised learning using randomized mincuts (2004)
Zhou, D., Bousquet, O., Lal, T., Weston, J., Schülkopf, B.: Learning with local and global consistency. In: Thrun, S., Saul, L.K., Schülkopf, B. (eds.) NIPS 2003, vol. 16, pp. 321–328. MIT Press, Cambridge (2004)
Belkin, M., Matveeva, I., Niyogi, P.: Regularization and semi-supervised learning on large graphs. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS, vol. 3120, pp. 624–638. Springer, Heidelberg (2004)
Kapoor, A., Qi, Y.A., Ahn, H., Picard, R.: Hyperparameter and kernel learning for graph based semi-supervised classification. In: Weiss, Y., Schölkopf, B., Platt, J. (eds.) Advances in Neural Information Processing Systems 18, pp. 627–634. MIT Press, Cambridge (2006)
Carreira-Perpiñán, M.Á., Zemel, R.S.: Proximity graphs for clustering and manifold learning. In: NIPS (2004)
Wang, F., Zhang, C.: Label propagation through linear neighborhoods. In: ICML 2006 (2006)
Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using gaussian fields and harmonic functions. In: Proceedings of the 20th International Conference on Machine Learning (ICML 2003) (2003)
Zhang, X., Lee, W.S.: Hyperparameter learning for graph based semi-supervised learning algorithms. In: Schölkopf, B., Platt, J., Hoffman, T. (eds.) Advances in Neural Information Processing Systems 19, pp. 1585–1592. MIT Press, Cambridge (2007)
Chapelle, O., Schölkopf, B., Zien, A. (eds.): Semi-Supervised Learning. MIT Press, Cambridge (2006)
Bousquet, O., Elisseeff, A.: Algorithmic stability and generalization performance. In: Leen, T.K., Dietterich, T.G., Tresp, V. (eds.) NIPS, pp. 196–202. MIT Press, Cambridge (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muandet, K., Marukatat, S., Nattee, C. (2009). Robust Graph Hyperparameter Learning for Graph Based Semi-supervised Classification. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, TB. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2009. Lecture Notes in Computer Science(), vol 5476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01307-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-01307-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01306-5
Online ISBN: 978-3-642-01307-2
eBook Packages: Computer ScienceComputer Science (R0)