Welcome to the InfoSci Platform
Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search

Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search

Bilegsaikhan Naidan, Magnus Lie Hetland
Copyright: © 2012 |Volume: 3 |Issue: 4 |Pages: 13
ISSN: 1947-8534|EISSN: 1947-8542|EISBN13: 9781466613607|DOI: 10.4018/jmdem.2012100104
Cite Article Cite Article

MLA

Naidan, Bilegsaikhan, and Magnus Lie Hetland. "Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search." IJMDEM vol.3, no.4 2012: pp.75-87. http://doi.org/10.4018/jmdem.2012100104

APA

Naidan, B. & Hetland, M. L. (2012). Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search. International Journal of Multimedia Data Engineering and Management (IJMDEM), 3(4), 75-87. http://doi.org/10.4018/jmdem.2012100104

Chicago

Naidan, Bilegsaikhan, and Magnus Lie Hetland. "Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search," International Journal of Multimedia Data Engineering and Management (IJMDEM) 3, no.4: 75-87. http://doi.org/10.4018/jmdem.2012100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article presents a new approximate index structure, the Bregman hyperplane tree, for indexing the Bregman divergence, aiming to decrease the number of distance computations required at query processing time, by sacrificing some accuracy in the result. The experimental results on various high-dimensional data sets demonstrate that the proposed index structure performs comparably to the state-of-the-art Bregman ball tree in terms of search performance and result quality. Moreover, this method results in a speedup of well over an order of magnitude for index construction. The authors also apply their space partitioning principle to the Bregman ball tree and obtain a new index structure for exact nearest neighbor search that is faster to build and a slightly slower at query processing than the original.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.