Fast nearest neighbor retrieval for bregman divergences

@inproceedings{Cayton2008FastNN,
  title={Fast nearest neighbor retrieval for bregman divergences},
  author={Lawrence Cayton},
  booktitle={ICML},
  year={2008}
}
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 Itakura-Saito 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… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 66 citations. REVIEW CITATIONS
44 Citations
3 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

66 Citations

0510'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Using the triangle inequality to survive high-dimensional data

  • A. W. Moore
  • UAI.
  • 2000
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…