Fast nearest neighbor retrieval for bregman divergences

We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measures including KL-divergence (relative entropy), Mahalanobis distance, and ItakuraSaito divergence. These divergences present a challenge for efficient NN retrieval because they are not, in general, metrics, for which most NN data structures are designed. The data structure introduced in this work shares the same basic structure as the popular metric ball tree, but employs convexity properties of bregman divergences in place of the triangle inequality. Experiments demonstrate speedups over brute-force search of up to several orders of magnitude.

• Type: Conference
• Year: 2008
• Where: ICML
• Authors: Lawrence Cayton
• Keywords: Bregman Divergences, Efficient Nearest Neighbor, Efficient Nn Retrieval, ICML 2008, Machine Learning