Neighbor search with global geometry: A minimax message passing algorithm

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 401-408

  Kim, Kye Hyeon ^a   Choi, Seungjin ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL GEOMETRY; GRAPH THEORY; IMAGE RETRIEVAL; SUPERVISED LEARNING;

GLOBAL GEOMETRY; MARKOV RANDOM WALKS; MINIMAX DISTANCE CALCULATION;

MESSAGE PASSING;

EID: 34547964789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273547     Document Type: Conference Paper

References (21)

1. Belkin, M., & Niyogi, P. (2003). Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15, 1373-1396.
2. Belkin, M., & Niyogi, P. (2004). Semi-supervised learning on Riemannian manifolds. Machine Learning, 56, 209-239.
3. Carroll, J. D. (1995). Minimax length links of a dissimilarity matrix and minimum spanning trees. Psychometrika, 60, 371-374.
4. Chang, H., & Yeung, D. Y. (2004). Locally linear metric adaptation for semi-supervised clustering. Proceedings of International Conference on Machine Learning (pp. 153-160).
5. Delalleau, O., Bengio, Y., & Roux, N. L. (2005). Efficient non-parametric function induction in semi-supervised learning. Proceedings of International Workshop on Artificial Intelligence and Statistics (pp. 96-103).
6. Domeniconi, C., Peng, J., & Gunopulos, D. (2002). Locally adaptive metric nearest-neighbor classificaton. IEEE Trans. Pattern Analysis and Machine Intelligence, 24, 1281-1285.
7. Fouss, F., Pirotte, A., & Saerens, M. (2005). A novel way of computing similarities between nodes of a graph, with application to collaborative recommendation. Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence (pp. 550-556).
8. Garcke, J., & Griebel, M. (2005). Semi-supervised learning with sparse grids. Proceedings of ICML, Workshop on Learning with Partially Classified Training Data (pp. 19-28).
9. Gower, J. C., & Ross, G. J. S. (1969). Minimum spanning tree and single-linkage cluster analysis. Applied Statistics, 18, 54-64.
10. Kschischang, F. R., Frey, B. J., & Loeliger, H. A. (2001). Factor graphs and the sum-product algorithm. IEEE Trans. Information Theory, 47, 498-519.
11. Roweis, S. T., & Saul, L. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2323-2326.
12. Shakhnarovich, G., Darrell, T., & Indyk, P. (2006). Nearest-neighbor methods in learning and vision: Theory and practice. MIT Press.
13. Spielman, D. A., & Teng, S. H. (2004). Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. Proceedings of Annual ACM Symposium on Theory of Computing (pp. 81-90).
14. Szummer, M., & Jaakkola, T. (2002). Partially labeled classification with Markov random walks. Advances in Neural Information Processing Systems (pp. 945-952). MIT Press.
15. Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319-2323.
16. Wang, F., & Zhang, C. (2006). Label propagation through linear neighborhoods. Proceedings of International Conference on Machine. Learning (pp. 985-992).
17. Xing, E. P., Ng, A. Y., Jordan, M. I., & Russel, S. (2003). Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems. MIT Press.
18. Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Scholkopf, B. (2004). Learning with local and global consistency. Advances in Neural Information Processing Systems (pp. 321-328). MIT Press.
19. Zhou, D., & Scholkopf, B. (2004). Learning from labeled and unlabeled data using random walks. Pattern Recognition, Proceedings of the 26th DAGM Symposium (pp. 237-244).
20. Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. Proceedings of International Conference on Machine Learning (pp. 912-919).
21. Zhu, X., & Lafferty, J. (2005). Harmonic mixtures: Combining mixture models and graph-based methods for inductive and scalable semi-supervised learning. Proceedings of International Conference on Machine Learning (pp. 1052-1059).