Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search

E-ISSN： 1947-8542|3|4|75-87

ISSN： 1947-8534

Source： International Journal of Multimedia Data Engineering and Management (IJMDEM), Vol.3, Iss.4, 2012-10, pp. : 75-87

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fast nearest neighbor search algorithm using the cache technique

By Choi Wonseok Oh Seyoung

Advanced Robotics, Vol. 27, Iss. 15, 2013-10 ,pp. : 1175-1187

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the use of Human-Computer Interaction for Projected Nearest Neighbor Search

By Aggarwal Charu

Data Mining and Knowledge Discovery, Vol. 13, Iss. 1, 2006-07 ,pp. : 89-117

Springer Publishing Company

Access to resources Recommend Favorite

Audio Fingerprinting: Nearest Neighbor Search in High Dimensional Binary Spaces

By Miller Matthew Rodriguez Manuel Cox Ingemar

Journal of VLSI Signal Processing, Vol. 41, Iss. 3, 2005-11 ,pp. : 285-291

Springer Publishing Company

Access to resources Recommend Favorite

A fast prototype reduction method based on template reduction and visualization-induced self-organizing map for nearest neighbor algorithm

By Li I-Jing Chen Jia-Chian Wu Jiunn-Lin

Applied Intelligence, Vol. 39, Iss. 3, 2013-10 ,pp. : 564-582

Springer Publishing Company

Access to resources Recommend Favorite

An Experimental Comparison of the Nearest-Neighbor and Nearest-Hyperrectangle Algorithms

By Wettschereck D.

Machine Learning, Vol. 19, Iss. 1, 1995-04 ,pp. : 5-27

Springer Publishing Company

Access to resources Recommend Favorite