Neighbor search with global geometry: a minimax message passing algorithm

Authors:
Kye-Hyeon Kim;Seungjin Choi
Affiliations:
Pohang University of Science and Technology, Pohang, Korea;Pohang University of Science and Technology, Pohang, Korea
Venue:
Proceedings of the 24th international conference on Machine learning
Year:
2007

Citing 10
Cited 2

Locally Adaptive Metric Nearest-Neighbor Classification

IEEE Transactions on Pattern Analysis and Machine Intelligence
Laplacian Eigenmaps for dimensionality reduction and data representation

Neural Computation
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Semi-Supervised Learning on Riemannian Manifolds

Machine Learning
Locally linear metric adaptation for semi-supervised clustering

ICML '04 Proceedings of the twenty-first international conference on Machine learning
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation

WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning

ICML '05 Proceedings of the 22nd international conference on Machine learning
Label propagation through linear neighborhoods

ICML '06 Proceedings of the 23rd international conference on Machine learning
Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing)

Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing)
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory

A collaborative filtering framework based on both local user similarity and global user similarity

Machine Learning
Characterizing pathological deviations from normality using constrained manifold-learning

MICCAI'11 Proceedings of the 14th international conference on Medical image computing and computer-assisted intervention - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with their emphasis on data structures but most of them did not consider the underlying global geometry of a data set. Recent graph-based semi-supervised learning methods capture the global geometry, but suffer from scalability and parameter tuning problems. In this paper we present a (nearest) neighbor search method where the underlying global geometry is incorporated and the parameter tuning is not required. To this end, we introduce deterministic walks as a deterministic counterpart of Markov random walks, leading us to use the minimax distance as a global dissimilarity measure. Then we develop a message passing algorithm for efficient minimax distance calculation, which scales linearly in both time and space. Empirical study reveals the useful behavior of the method in image retrieval and semi-supervised learning.