Robust Graph Hyperparameter Learning for Graph Based Semi-supervised Classification

Authors:
Krikamol Muandet;Sanparith Marukatat;Cholwich Nattee
Affiliations:
School of Information, Computer and Communication Technology Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Thailand 12000;National Electronic and Computer Technology Center National Science and Technology Development Agency, Pathum Thani, Thailand 12120;School of Information, Computer and Communication Technology Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Thailand 12000
Venue:
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Year:
2009

Citing 2
Cited 0

Learning from Labeled and Unlabeled Data using Graph Mincuts

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Label propagation through linear neighborhoods

ICML '06 Proceedings of the 23rd international conference on Machine learning

Quantified Score

Hi-index	0.00

Visualization

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.