1. Performance evaluation: Ball-tree and KD-tree in the context of MST;munaga;Proc Int Joint Conf Adv Signal Process Inf Technol,2011
2. The anchors hierarchy: Using the triangle inequality to survive high dimensional data;moore;Proc 16th Conf Uncertainity Artif Intell,2000
3. Five balltree construction algorithms;omohundro,1989
4. Tailored Bregman ball trees for effective nearest neighbors;nielsen;Proc 25th Eur Workshop Comput Geometry (EuroCG),2009