Study on weak bit in Vote Count and its application in k-Nearest Neighbors Algorithm

In the Vote Count for k-Nearest Neighbors (kNN) algorithm, the quantized projection values of query and training/reference vectors are compared and counted. In this process, not all quantized projection results are reliable for bit-matching and the search result may be distorted by these unreliable bit-matching. In this paper, the concept of weak bit is introduced to identify those unreliable bits after quantization and the corresponding bit-matching comparison is not executed. Simulation results show that, when weak bit is employed, the accuracy of kNN based on Vote Count can be improved significantly.

[1]  Ashish Goel,et al.  Similarity search and locality sensitive hashing using ternary content addressable memories , 2010, SIGMOD Conference.

[2]  Ton Kalker,et al.  A Highly Robust Audio Fingerprinting System , 2002, ISMIR.

[3]  Zhe Wang,et al.  Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search , 2007, VLDB.

[4]  Nicole Immorlica,et al.  Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.

[5]  Yasin Abbasi-Yadkori,et al.  Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph , 2011, IJCAI.

[6]  Peter E. Hart,et al.  The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[7]  Pietro Perona,et al.  Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories , 2004, 2004 Conference on Computer Vision and Pattern Recognition Workshop.

[8]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[9]  Yousef Saad,et al.  Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection , 2009, J. Mach. Learn. Res..

[10]  Yu Rongshan,et al.  High-performance, very low power content-based search engine , 2013, 2013 IEEE International Conference on Multimedia and Expo Workshops (ICMEW).

[11]  Shumeet Baluja,et al.  Beyond “Near Duplicates”: Learning Hash Codes for Efficient Similar-Image Retrieval , 2010, 2010 20th International Conference on Pattern Recognition.

[12]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[13]  Keinosuke Fukunaga,et al.  Bias of Nearest Neighbor Error Estimates , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  C. G. Hilborn,et al.  The Condensed Nearest Neighbor Rule , 1967 .

[15]  Wenyu Jiang,et al.  An Algorithm and Hardware Design for Very Fast Similarity Search in High Dimensional Space , 2010, 2010 IEEE International Conference on Granular Computing.

[16]  Wenyu Jiang,et al.  Efficient Implementation of $k$-Nearest Neighbor Classifier Using Vote Count Circuit , 2014, IEEE Transactions on Circuits and Systems II: Express Briefs.

[17]  Pietro Perona,et al.  Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories , 2004, 2004 Conference on Computer Vision and Pattern Recognition Workshop.

[18]  Antonio Torralba,et al.  Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope , 2001, International Journal of Computer Vision.