Influence of graph construction on semi-supervised learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8190 LNAI, Issue PART 3, 2013, Pages 160-175

  De Sousa, Celso André R ^a   Rezende, Solange O ^a   Batista, Gustavo E A P A ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

classification; experimental study; graph based methods; Semi supervised learning

Indexed keywords

CLASSIFICATION PERFORMANCE; EXPERIMENTAL STUDY; GRAPH-BASED METHODS; GRAPH-CONSTRUCTION METHOD; MUTUAL K-NEAREST NEIGHBORS; REGULARIZATION PARAMETERS; SEMI-SUPERVISED LEARNING; SEMI-SUPERVISED LEARNING (SSL);

ALGORITHMS; CLASSIFICATION (OF INFORMATION); GRAPHIC METHODS; SUPERVISED LEARNING;

PARAMETER ESTIMATION;

EID: 84886483781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40994-3_11     Document Type: Conference Paper

References (16)

1. Belkin, M., Niyogi, P., Sindhwani, V.: Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. JMLR 7, 2399-2434 (2006)
2. Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is "nearest neighbor" meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217-235. Springer, Heidelberg (1998)
3. Chapelle, O., Schölkopf, B., Zien, A.: Semi-supervised learning. The MIT Press (2006)
4. Demšar, J.: Statistical comparisons of classifiers over multiple data sets. JMLR 7, 1-30 (2006)
5. Hein, M., Maier, M.: Manifold denoising. In: NIPS 19, pp. 561-568 (2007)
6. Jebara, T., Wang, J., Chang, S.F.: Graph construction and b-matching for semisupervised learning. In: ICML, pp. 441-448 (2009)
7. Johnson, R., Zhang, T.: On the effectiveness of laplacian normalization for graph semi-supervised learning. JMLR 8, 1489-1517 (2007)
8. Liu, W., Chang, S.F.: Robust multi-class transductive learning with graphs. In: CVPR, pp. 381-388 (2009)
9. Liu, W., He, J., Chang, S.F.: Large graph construction for scalable semi-supervised learning. In: ICML, pp. 679-686 (2010)
10. Maier, M., Hein, M., von Luxburg, U.: Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters. Theoretical Computer Science 410(19), 1749-1764 (2009)
11. Melacci, S., Belkin, M.: Laplacian support vector machines trained in the primal. JMLR 12, 1149-1184 (2011)
12. Ozaki, K., Shimbo, M., Komachi, M., Matsumoto, Y.: Using the mutual k-nearest neighbor graphs for semi-supervised classification of natural language data. In: CoNLL, pp. 154-162 (2011)
13. Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323-2326 (2000)
14. Zhou, D., Bousquet, O., Lal, T., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: NIPS 16, pp. 321-328 (2004)
15. Zhu, X.: Semi-supervised learning literature survey. Tech. Rep. 1530, Computer Sciences, University of Wisconsin-Madison (2005)
16. Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using gaussian fields and harmonic functions. In: ICML, pp. 912-919 (2003)