Tailored Bregman Ball Trees for Effective Nearest Neighbors ∗

@inproceedings{Nielsen2009TailoredBB,
  title={Tailored Bregman Ball Trees for Effective Nearest Neighbors ∗},
  author={Frank Nielsen and Paolo Piro and Michel Barlaud},
  year={2009}
}
Nearest Neighbor (NN) search is a crucial tool that remains critical in many challenging applications of computational geometry (e.g., surface reconstruction, clustering) and computer vision (e.g., image and information retrieval, classification, data mining). We present an effective Bregman ball tree [5] (Bb-tree) construction algorithm that adapts locally its internal node degrees to the inner geometric characteristics of the data-sets. Since symmetric measures are usually preferred for… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…