Graph construction and b-matching for semi-supervised learning

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 441-448

  Jebara, Tony ^a   Wang, Jun ^a   Chang, Shih Fu ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING MINIMIZATION; ARTIFICIAL DATA; B-MATCHING; BENCHMARK DATASETS; BUILDING METHODS; COMPUTATION TIME; EMPIRICAL STUDIES; GAUSSIAN RANDOM FIELDS; GLOBAL CONSISTENCY; GRAPH CONSTRUCTION; GRAPH-BASED; INFERENCE ALGORITHM; K-NEAREST NEIGHBORS METHOD; MACHINE LEARNING SYSTEMS; PREDICTION ACCURACY; REGULAR GRAPHS; ROBUST GRAPHS; SEMI-SUPERVISED LEARNING; SEMI-SUPERVISED METHOD; WEIGHTED GRAPH;

EDUCATION; GAUSSIAN DISTRIBUTION; INFERENCE ENGINES; ROBOT LEARNING; SUPERVISED LEARNING;

GRAPH THEORY;

EID: 71149102018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Bayati, M., Shah, D., & Sharma, M. (2005). Maximum weight matching via max-product belief propagation. Int. Symp. on Information Theory (pp. 1763-1767).
2. Belkin, M., & Niyogi, P. (2008). Towards a Theoretical Foundation for Laplacian Based Manifold Methods. J. Comput. System Sci, 1289-1308.
3. Belkin, M., Niyogi, P., & Sindhwani, V. (2005). On manifold regularization. Int. Workshop on Artificial Intelligence and Statistics.
4. Blum, A., & Chawla, S. (2001). Learning from labeled and unlabeled data using graph mincuts. Int. Conf. on Mach. Learn. (pp. 19-26).
5. Chapelle, O., Schölkopf, B., & Zien, A. (Eds.). (2006). Semi-supervised learning. Cambridge, MA: MIT Press.
6. Chung, F. (1997). Spectral Graph Theory. American Mathematical Society.
7. Edmonds, J. (1965). Paths, trees and flowers. Canadian Journal of Mathematics, 17, 449-467.
8. Huang, B., & Jebara, T. (2007). Loopy belief propagation for bipartite maximum weight b-matching. Int. Workshop on Artificial Intelligence and Statistics.
9. Jebara, T., & Shchogolev, V. (2006). B-Matching for Spectral Clustering. The European Conf. on Mach. Learn. (pp. 679-686). Springer.
10. Maier, M., & Luxburg, U. (2009). Influence of graph construction on graph-based clustering measures. The Neural Information Processing Systems, 22, 1025-1032.
11. Roweis, S., & Saul, L. (2000). Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 290, 2323-2326.
12. Salez, J., & Shah, D. (2009). Optimally of Belief Propagation for Random Assignment Problem. ACM-SIAM Symp. on Discrete Algorithms.
13. Wang, F., & Zhang, C. S. (2008). Label propagation through linear neighborhoods. IEEE Trans. Knowl. Data Eng., 20, 55-67.
14. Wang, J., Jebara, T., & Chang, S. F. (2008). Graph transduction via alternating minimization. Int. Conf. on Mach. Learn. (pp. 1144-1151).
15. Zhang, J., Marszalek, M., Lazebnik, S., & Schmid, C. (2007). Local Features and Kernels for Classification of Texture and Object Categories: A Comprehensive Study. Int. J. Compt. Vision., 73, 213-238.
16. Zhou, D., Bousquet, O., Lal, T., Weston, J., & Schölkopf, B. (2004). Learning with local and global consistency. The Neural Information Processing Systems (pp. 321-328).
17. Zhu, X. (2005). Semi-supervised learning literature survey (Technical Report 1530). Computer Sciences, University of Wisconsin-Madison.
18. Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semi-supervised learning using gaussian fields and harmonic functions. Int. Conf. on Mach. Learn. (pp. 912-919).