Kim, B.S., and
Park, S.B.,
A Fast K Nearest Neighbor Finding Algorithm Based on the
Ordered Partition,
PAMI(8), No. 6, November 1986, pp. 761-766.
BibRef
8611
Broder, A.J.[Alan J.],
Strategies for efficient incremental nearest neighbor search,
PR(23), No. 1-2, 1990, pp. 171-178.
Elsevier DOI
0401
BibRef
Belkasim, S.O.,
Shridhar, M.,
Ahmadi, M.,
Pattern classification using an efficient KNNR,
PR(25), No. 10, October 1992, pp. 1269-1274.
Elsevier DOI
0401
BibRef
Farago, A.,
Linder, T.,
Lugosi, G.,
Fast nearest-neighbor search in dissimilarity spaces,
PAMI(15), No. 9, September 1993, pp. 957-962.
IEEE DOI
0401
BibRef
Kao, T.W.[Tzong-Wann],
Horng, S.J.[Shi-Jinn],
Efficient algorithms for computing two nearest-neighbor problems on a
rap,
PR(27), No. 12, December 1994, pp. 1707-1716.
Elsevier DOI
0401
BibRef
Mico, L.[Luisa],
Oncina, J.[Jose],
Carrasco, R.C.,
A Fast Branch-and-Bound Nearest-Neighbor Classifier in Metric-Spaces,
PRL(17), No. 7, June 10 1996, pp. 731-739.
9607
BibRef
Mico, L.[Luisa],
Oncina, J.[Jose],
Vidal, E.,
An algorithm for finding nearest neighbours in constant average time
with a linear space complexity,
ICPR92(II:557-560).
IEEE DOI
9208
BibRef
Gómez Ballester, E.[Eva],
Micó, L.[Luisa],
Oncina, J.[Jose],
Some approaches to improve tree-based nearest neighbour search
algorithms,
PR(39), No. 2, February 2006, pp. 171-179.
Elsevier DOI
0512
BibRef
Earlier:
Testing Some Improvements of the Fukunaga and Narendra's Fast Nearest
Neighbour Search Algorithm in a Spelling Task,
IbPRIA05(II:3).
Springer DOI
0509
BibRef
Mico, L.[Luisa],
Oncina, J.[Jose],
Dynamic Insertions in TLAESA Fast NN Search Algorithm,
ICPR14(3828-3833)
IEEE DOI
1412
Heuristic algorithms
BibRef
Moreno-Seco, F.[Francisco],
Micó, L.[Luisa],
Oncina, J.[Jose],
A modification of the LAESA algorithm for approximated k-NN
classification,
PRL(24), No. 1-3, January 2003, pp. 47-53.
Elsevier DOI
0211
BibRef
Earlier:
A new classification rule based on nearest neighbour search,
ICPR04(IV: 408-411).
IEEE DOI
0409
BibRef
Socorro, R.[Raisa],
Mico, L.[Luisa],
Oncina, J.[Jose],
A fast pivot-based indexing algorithm for metric spaces,
PRL(32), No. 11, 1 August 2011, pp. 1511-1516.
Elsevier DOI
1108
Fast nearest neighbor; Similarity search; Metric space
See also approximate median search algorithm in non-metric spaces, An.
BibRef
Serrano, A.[Aureo],
Micó, L.[Luisa],
Oncina, J.[Jose],
Which Fast Nearest Neighbour Search Algorithm to Use?,
IbPRIA13(567-574).
Springer DOI
1307
BibRef
Mico, L.[Luisa],
Oncina, J.[Jose],
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast
Nearest Neighbour Search Index,
ICPR10(3911-3914).
IEEE DOI
1008
BibRef
Warfield, S.,
Fast K-NN Classification for Multichannel Image Data,
PRL(17), No. 7, June 10 1996, pp. 713-721.
9607
BibRef
Djouadi, A.,
Bouktache, E.,
A Fast Algorithm for the Nearest-Neighbor Classifier,
PAMI(19), No. 3, March 1997, pp. 277-282.
IEEE DOI
9704
BibRef
Djouadi, A.,
On the Reduction of the Nearest Neighbor Variation for
More Accurate Classification and Error Estimates,
PAMI(20), No. 5, May 1998, pp. 567-571.
IEEE DOI
9806
BibRef
Grother, P.J.[Patrick J.],
Candela, G.T.[Gerald T.],
Blue, J.L.[James L.],
Fast Implementations of Nearest-Neighbor Classifiers,
PR(30), No. 3, March 1997, pp. 459-465.
Elsevier DOI
9705
BibRef
Lee, E.W.,
Chae, S.I.,
Fast Design of Reduced Complexity Nearest Neighbor Classifiers
Using Triangular Inequality,
PAMI(20), No. 5, May 1998, pp. 562-566.
IEEE DOI
9806
BibRef
Ramasubramanian, V.,
Paliwal, K.K.[Kuldip K.],
Fast nearest-neighbor search algorithms based on
approximation-elimination search,
PR(33), No. 9, September 2000, pp. 1497-1510.
Elsevier DOI
0005
BibRef
Fränti, P.[Pasi],
Kaukoranta, T.[Timo],
Shen, D.F.,
Chang, K.S.,
Fast and Memory Efficient Implementation of the Exact PNN,
IP(9), No. 5, May 2000, pp. 773-777.
IEEE DOI
0005
BibRef
Virmajoki, O.[Olli],
Fränti, P.[Pasi],
Kaukoranta, T.[Timo],
Fast PNN Using Partial Distortion Search,
CAIP01(77 ff.).
Springer DOI
0210
BibRef
Franti, P.,
Kaukoranta, T.,
Fast implementation of the optimal PNN method,
ICIP98(III: 104-108).
IEEE DOI
9810
BibRef
McNames, J.[James],
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree,
PAMI(23), No. 9, September 2001, pp. 964-976.
IEEE DOI
0110
At each node partition the data along the maximum variance (from PCA).
BibRef
Cha, S.H.[Sung-Hyuk],
Srihari, S.N.[Sargur N.],
A fast nearest neighbor search algorithm by filtration,
PR(35), No. 2, February 2002, pp. 515-525.
Elsevier DOI
0201
BibRef
Earlier:
Nearest Neighbor Search using Additive Binary Tree,
CVPR00(I: 782-787).
IEEE DOI
0005
BibRef
Zhang, B.[Bin],
Srihari, S.N.,
Fast K-Nearest Neighbor Classification Using Cluster-Based Trees,
PAMI(26), No. 4, April 2004, pp. 525-528.
IEEE Abstract.
0403
BibRef
Earlier:
A fast algorithm for finding k-nearest neighbors with non-metric
dissimilarity,
FHR02(13-18).
IEEE Top Reference.
0209
Cluster based tree algorithm. Early decision making and minimal operations
to reduce time.
BibRef
Bandyopadhyay, S.[Sanghamitra],
Maulik, U.[Ujjwal],
Efficient prototype reordering in nearest neighbor classification,
PR(35), No. 12, December 2002, pp. 2791-2799.
Elsevier DOI
0209
See also Fuzzy partitioning using a real-coded variable-length genetic algorithm for pixel classification.
BibRef
Mollineda, R.A.,
Ferri, F.J.,
Vidal, E.,
An efficient prototype merging strategy for the condensed 1-NN rule
through class-conditional hierarchical clustering,
PR(35), No. 12, December 2002, pp. 2771-2782.
Elsevier DOI
0209
BibRef
Earlier: A2, A1, A3:
An experimental comparison between consistency-based and adaptive
prototype replacement schemes,
ICPR02(III: 41-44).
IEEE DOI
0211
BibRef
Earlier: A1, A2, A3:
A Cluster-based Merging Strategy for Nearest Prototype Classifiers,
ICPR00(Vol II: 755-758).
IEEE DOI
0009
BibRef
Ferri, F.J.[Francesc J.],
Salvador-Sánchez, J.,
Pla, F.[Filiberto],
Complexity reduction in efficient prototype-based classification,
PR(39), No. 2, February 2006, pp. 161-163.
Elsevier DOI
0512
Introduction.
BibRef
Micó, L.[Luisa],
Moreno-Seco, F.[Francisco],
Salvador Sánchez, J.[José],
Martinez Sotoca, J.[José],
Mollineda, R.A.[Ramón Alberto],
On the Use of Different Classification Rules in an Editing Task,
SSPR06(747-754).
Springer DOI
0608
BibRef
Rendón, E.[Erendira],
Salvador Sánchez, J.[José],
Clustering Based on Compressed Data for Categorical and Mixed
Attributes,
SSPR06(817-825).
Springer DOI
0608
BibRef
Mollineda, R.A.[Ramón A.],
Salvador-Sánchez, J.,
Martínez Sotoca, J.[José],
Data Characterization for Effective Prototype Selection,
IbPRIA05(II:27).
Springer DOI
0509
BibRef
Zheng, W.M.[Wen-Ming],
Zhao, L.[Li],
Zou, C.R.[Cai-Rong],
Locally nearest neighbor classifiers for pattern classification,
PR(37), No. 6, June 2004, pp. 1307-1309.
Elsevier DOI
0405
Rapid communication.
BibRef
Viswanath, P.,
Murty, M.N.[M. Narasimha],
Bhatnagar, S.[Shalabh],
Overlap pattern synthesis with an efficient nearest neighbor classifier,
PR(38), No. 8, August 2005, pp. 1187-1195.
Elsevier DOI
0505
BibRef
Earlier:
A pattern synthesis technique with an efficient nearest neighbor
classifier for binary pattern recognition,
ICPR04(IV: 416-419).
IEEE DOI
0409
BibRef
Viswanath, P.,
Murty, M.N.[M. Narasimha],
Bhatnagar, S.[Shalabh],
Partition based pattern synthesis technique with efficient algorithms
for nearest neighbor classification,
PRL(27), No. 14, 15 October 2006, pp. 1714-1724.
Elsevier DOI
0609
Pattern synthesis; Artificial patterns; Curse of dimensionality
BibRef
Agrawal, M.[Monu],
Gupta, N.[Neha],
Shreelekshmi, R.,
Murty, M.N.[M. Narasimha],
Efficient pattern synthesis for nearest neighbour classifier,
PR(38), No. 11, November 2005, pp. 2200-2203.
Elsevier DOI
0509
BibRef
Raicharoen, T.[Thanapant],
Lursinsap, C.[Chidchanok],
A divide-and-conquer approach to the pairwise opposite class-nearest
neighbor (POC-NN) algorithm,
PRL(26), No. 10, 15 July 2005, pp. 1554-1567.
Elsevier DOI
0506
BibRef
Sookhanaphibarn, K.,
Raicharoen, T.[Thanapant],
Lursinsap, C.[Chidchanok],
A supervised neural network approach to invariant image recognition,
ICARCV04(III: 1820-1825).
IEEE DOI
0412
BibRef
Cano, J.R.[José Ramón],
Herrera, F.[Francisco],
Lozano, M.[Manuel],
Stratification for scaling up evolutionary prototype selection,
PRL(26), No. 7, 15 May 2005, pp. 953-963.
Elsevier DOI
0506
Evolutionary Prototype Selection with large datasets.
BibRef
Garcia, S.[Salvador],
Cano, J.R.[Jose Ramon],
Herrera, F.[Francisco],
A memetic algorithm for evolutionary prototype selection:
A scaling up approach,
PR(41), No. 8, August 2008, pp. 2693-2709.
Elsevier DOI
0805
Data reduction; Evolutionary algorithms; Memetic algorithms;
Prototype selection; Scaling up; Nearest neighbour rule; Data mining
BibRef
Cano, J.R.[Jose-Ramon],
Garcia, S.[Salvador],
Herrera, F.[Francisco],
Subgroup discover in large size data sets preprocessed using stratified
instance selection for increasing the presence of minority classes,
PRL(29), No. 16, 1 December 2008, pp. 2156-2164.
Elsevier DOI
0811
Large size data sets; Scaling up; Subgroup discovery; Instance
selection; Stratification; Minority classes
BibRef
Amores, J.[Jaume],
Sebe, N.[Nicu],
Radeva, P.I.[Petia I.],
Boosting the distance estimation:
Application to the K-Nearest Neighbor Classifier,
PRL(27), No. 3, February 2006, pp. 201-209.
Elsevier DOI
0512
BibRef
Earlier:
Efficient Object-Class Recognition by Boosting Contextual Information,
IbPRIA05(I:28).
Springer DOI
0509
BibRef
And:
Fast Spatial Pattern Discovery Integrating Boosting with Constellations
of Contextual Descriptors,
CVPR05(II: 769-774).
IEEE DOI
0507
Apply to retrieval.
See also Context-Based Object-Class Recognition and Retrieval by Generalized Correlograms.
BibRef
Chen, Y.S.[Yong-Sheng],
Hung, Y.P.[Yi-Ping],
Yen, T.F.[Ting-Fang],
Fuh, C.S.[Chiou-Shann],
Fast and versatile algorithm for nearest neighbor search based on a
lower bound tree,
PR(40), No. 2, February 2007, pp. 360-375.
Elsevier DOI
0611
Nearest neighbor search; Lower bound tree
BibRef
Chen, Y.S.[Yong-Sheng],
Hung, Y.P.[Yi-Ping],
Fuh, C.S.[Chiou-Shann],
Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree,
ICCV01(I: 446-453).
IEEE DOI
0106
BibRef
Earlier:
Winner-update Algorithm for Nearest Neighbor Search,
ICPR00(Vol II: 704-707).
IEEE DOI
0009
BibRef
Lai, J.Z.C.[Jim Z.C.],
Liaw, Y.C.[Yi-Ching],
Liu, J.[Julie],
Fast k-nearest-neighbor search based on projection and triangular
inequality,
PR(40), No. 2, February 2007, pp. 351-359.
Elsevier DOI
0611
Fast search algorithm; Projection value; Intrinsic dimension
BibRef
Li, B.Y.[Bo Yu],
Chen, Y.W.[Yun Wen],
The Nearest Neighbor Algorithm of Local Probability Centers,
SMC-B(38), No. 1, February 2007, pp. 141-154.
IEEE DOI
0801
BibRef
Earlier:
Classification Using the Local Probabilistic Centers of k-Nearest
Neighbors,
ICPR06(III: 1220-1223).
IEEE DOI
0609
BibRef
And:
ICPR06(IV: 954).
IEEE DOI
0609
BibRef
Battiato, S.,
di Blasi, G.,
Reforgiato, D.,
Advanced indexing schema for imaging applications: three case studies,
IET-IPR(1), No. 3, September 2007, pp. 249-268.
DOI Link
0905
Finding k-nearest neighbor.
BibRef
Atiya, A.F.[Amir F.],
Al-Ani, A.[Ahmed],
A penalized likelihood based pattern classification algorithm,
PR(42), No. 11, November 2009, pp. 2684-2694.
Elsevier DOI
0907
K-nearest neighbor; Penalized likelihood; Pattern classification;
Posterior probability; Class balancing; Weighted KNN
BibRef
Hernández-Rodríguez, S.[Selene],
Martínez-Trinidad, J.F.[José Francisco],
Carrasco-Ochoa, J.A.[J. Ariel],
Fast k most similar neighbor classifier for mixed data (tree k-MSN),
PR(43), No. 3, March 2010, pp. 873-886.
Elsevier DOI
1001
BibRef
Earlier: A1, A3, A2:
Fast k Most Similar Neighbor Classifier for Mixed Data Based on a Tree
Structure and Approximating-Eliminating,
CIARP08(364-371).
Springer DOI
0809
BibRef
Earlier: A1, A2, A3:
Fast k Most Similar Neighbor Classifier for Mixed Data Based on a Tree
Structure,
CIARP07(407-416).
Springer DOI
0711
Nearest neighbor rule; Fast k nearest neighbor search; Mixed data;
Non-metric comparison functions
BibRef
Chang, C.T.[Chih-Tang],
Lai, J.Z.C.[Jim Z.C.],
Jeng, M.D.,
Fast agglomerative clustering using information of k-nearest neighbors,
PR(43), No. 12, December 2010, pp. 3958-3968.
Elsevier DOI
1003
Nearest neighbor; Agglomerative clustering; Vector quantization
BibRef
Beliakov, G.[Gleb],
Li, G.[Gang],
Improving the speed and stability of the k-nearest neighbors method,
PRL(33), No. 10, 15 July 2012, pp. 1296-1301.
Elsevier DOI
1205
kNN; Nearest neighbors; Order statistics; Selection; Sorting; Graphics
Processing Units
BibRef
Lin, J.F.[Jun-Feng],
Liaw, Y.C.[Yi-Ching],
Chan, K.Y.[Kwan-Yee],
Wu, S.C.[Song-Chan],
Fast exact local-mean based classification algorithm using class
rejection and initial distance assigning processes,
PRL(33), No. 12, 1 September 2012, pp. 1507-1512.
Elsevier DOI
1208
Local-mean based classification; k-nearest-neighbor equality; Fast
k-nearest-neighbor search
BibRef
Esmaeili, M.M.[Mani Malek],
Ward, R.K.[Rabab Kreidieh],
Fatourechi, M.[Mehrdad],
A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming
Space,
PAMI(34), No. 12, December 2012, pp. 2481-2488.
IEEE DOI
1210
BibRef
Marukatat, S.[Sanparith],
Methasate, I.[Ithipan],
Fast nearest neighbor retrieval using randomized binary codes and
approximate Euclidean distance,
PRL(34), No. 9, July 2013, pp. 1101-1107.
Elsevier DOI
1305
Fast nearest neighbor search; Binary code indexing; Hamming distance;
Approximate Euclidean distance
BibRef
Wang, J.D.[Jing-Dong],
Wang, N.[Naiyan],
Jia, Y.[You],
Li, J.[Jian],
Zeng, G.[Gang],
Zha, H.B.[Hong-Bin],
Hua, X.S.[Xian-Sheng],
Trinary-Projection Trees for Approximate Nearest Neighbor Search,
PAMI(36), No. 2, February 2014, pp. 388-403.
IEEE DOI
1402
approximation theory. Using decision trees.
BibRef
Cheng, H.[Hong],
Yu, R.C.[Rong-Chao],
Liu, Z.C.[Zi-Cheng],
Yang, L.[Lu],
Chen, X.W.[Xue-Wen],
Kernelized pyramid nearest-neighbor search for object categorization,
MVA(25), No. 4, May 2014, pp. 931-941.
Springer DOI
1404
BibRef
Cheng, H.[Hong],
Yu, R.C.[Rong-Chao],
Liu, Z.C.[Zi-Cheng],
Liu, Y.G.[Yi-Guang],
A Pyramid Nearest Neighbor Search Kernel for object categorization,
ICPR12(2809-2812).
WWW Link.
1302
BibRef
Ramakanth, S.A.,
Babu, R.V.,
FeatureMatch:
A General ANNF Estimation Technique and its Applications,
IP(23), No. 5, May 2014, pp. 2193-2205.
IEEE DOI
1405
Approximate Nearest-Neighbour Field.
Approximation algorithms
BibRef
Liu, S.G.[Shi-Guang],
Wei, Y.W.[Yin-Wei],
Fast nearest neighbor searching based on improved VP-tree,
PRL(60-61), No. 1, 2015, pp. 8-15.
Elsevier DOI
1506
Nearest neighbor searching
BibRef
Zhao, H.W.[Hong-Wei],
Wang, Z.[Zhen],
Liu, P.P.[Ping-Ping],
The ordinal relation preserving binary codes,
PR(48), No. 10, 2015, pp. 3169-3179.
Elsevier DOI
1507
Hashing algorithm.
Approximate nearest neighbor.
BibRef
Zhan, K.[Kun],
Guan, J.P.[Jun-Peng],
Yang, Y.[Yi],
Wu, Q.[Qun],
Unsupervised discriminative hashing,
JVCIR(40, Part B), No. 1, 2016, pp. 847-851.
Elsevier DOI
1610
Unsupervised discriminative hashing
BibRef
Hu, W.,
Tan, Y.,
Prototype Generation Using Multiobjective Particle Swarm Optimization
for Nearest Neighbor Classification,
Cyber(46), No. 12, December 2016, pp. 2719-2731.
IEEE DOI
1612
Error analysis
BibRef
Li, J.[Jin],
Lan, X.G.[Xu-Guang],
Li, X.W.[Xiang-Wei],
Wang, J.[Jiang],
Zheng, N.N.[Nan-Ning],
Wu, Y.[Ying],
Online Variable Coding Length Product Quantization for Fast Nearest
Neighbor Search in Mobile Retrieval,
MultMed(19), No. 3, March 2017, pp. 559-570.
IEEE DOI
1702
Bit rate
BibRef
Hu, L.J.[Lin-Jia],
Nooshabadi, S.[Saeid],
Massive parallelization of approximate nearest neighbor search on
KD-tree for high-dimensional image descriptor matching,
JVCIR(44), No. 1, 2017, pp. 106-115.
Elsevier DOI
1703
KD-tree
BibRef
Zhang, Y.[Yupei],
Xiang, M.[Ming],
Yang, B.[Bo],
Graph regularized nonnegative sparse coding using incoherent
dictionary for approximate nearest neighbor search,
PR(70), No. 1, 2017, pp. 75-88.
Elsevier DOI
1706
Nonnegative, sparse, coding
BibRef
Sohn, S.,
Kim, H.,
Kim, J.,
Uncorrelated Component Analysis-Based Hashing,
IP(26), No. 8, August 2017, pp. 3759-3774.
IEEE DOI
1707
approximation theory, file organisation, information retrieval,
search problems, ANN search problem, UCA-based hashing method,
approximate nearest neighbor search problem, encoding process,
information retrieval, precision maximization,
projection-based hashing method, recall maximization,
training process,
uncorrelated component analysis transformation,
uncorrelated component analysis-based hashing,
Complexity theory, Databases, Hamming distance, Linear programming,
Principal component analysis, Quantization (signal),
Search problems, Information retrieval, hashing
BibRef
Figueroa, K.[Karina],
Paredes, R.[Rodrigo],
Camarena-Ibarrola, A.[Antonio],
Tejeda-Villela, H.[Héctor],
Improving the permutation-based proximity searching algorithm using
zones and partial information,
PRL(95), No. 1, 2017, pp. 29-36.
Elsevier DOI
1708
Nearest neighbor
BibRef
Jin, L.[Lu],
Li, K.[Kai],
Hu, H.[Hao],
Qi, G.J.[Guo-Jun],
Tang, J.H.[Jin-Hui],
Semantic Neighbor Graph Hashing for Multimodal Retrieval,
IP(27), No. 3, March 2018, pp. 1405-1417.
IEEE DOI
1801
Automobiles, Buildings, Correlation, Measurement, Roads, Semantics,
Vegetation, Multimodal hashing, fine-grained similarity metric,
semantic supervision
BibRef
Su, L.L.[Liang-Liang],
Tang, J.[Jun],
Yan, P.[Pu],
Liang, D.[Dong],
Bao, W.X.[Wen-Xia],
Multi-bit quantization based on neighboring structure preservation,
PRL(102), 2018, pp. 23-29.
Elsevier DOI
1802
Approximate nearest neighbor search, Neighboring structure,
Hashing, Quantization coding
BibRef
Li, L.H.[Lin-Hao],
Hu, Q.H.[Qing-Hua],
Han, Y.H.[Ya-Hong],
Li, X.[Xin],
Distribution Sensitive Product Quantization,
CirSysVideo(28), No. 12, December 2018, pp. 3504-3515.
IEEE DOI
1812
Approximate nearest neighbor (ANN) search for high-dimensional data.
Quantization (signal), Distortion, Indexes, Optimization, Encoding,
Bit rate, Aggregates, aggregate degree
BibRef
Medeiros, H.R.[Heitor R.],
de Oliveira, F.D.B.[Felipe D.B.],
Bassani, H.F.[Hansenclever F.],
Araujo, A.F.R.[Aluizio F.R.],
Dynamic topology and relevance learning SOM-based algorithm for image
clustering tasks,
CVIU(179), 2019, pp. 19-30.
Elsevier DOI
1903
Self-Organizing-Map.
Image clustering, Self-organization, Relevance learning
BibRef
Wang, J.D.[Jing-Dong],
Zhang, T.[Ting],
Composite Quantization,
PAMI(41), No. 6, June 2019, pp. 1308-1322.
IEEE DOI
1905
Approximate nearest neighbor search, quantization,
composite quantization, near-orthogonality
BibRef
Cao, Y.,
Qi, H.,
Gui, J.,
Li, S.,
Li, K.,
General Distributed Hash Learning on Image Descriptors for k-Nearest
Neighbor Search,
SPLetters(26), No. 5, May 2019, pp. 750-754.
IEEE DOI
1905
binary codes, file organisation, image retrieval,
learning (artificial intelligence), nearest neighbour methods,
distributed data
BibRef
Xie, H.,
Mao, Z.,
Zhang, Y.,
Deng, H.,
Yan, C.,
Chen, Z.,
Double-Bit Quantization and Index Hashing for Nearest Neighbor Search,
MultMed(21), No. 5, May 2019, pp. 1248-1260.
IEEE DOI
1905
binary codes, database management systems, feature extraction,
file organisation, image retrieval, nearest neighbour methods,
binary embedding
BibRef
Zhang, Z.[Zheng],
Liu, L.[Li],
Shen, F.M.[Fu-Min],
Shen, H.T.[Heng Tao],
Shao, L.[Ling],
Binary Multi-View Clustering,
PAMI(41), No. 7, July 2019, pp. 1774-1782.
IEEE DOI
1906
Binary codes, Optimization, Clustering methods, Collaboration,
Convergence, Complexity theory, Visualization,
discrete representation
BibRef
Wan, D.W.[Di-Wen],
Shen, F.M.[Fu-Min],
Liu, L.[Li],
Zhu, F.[Fan],
Qin, J.[Jie],
Shao, L.[Ling],
Shen, H.T.[Heng Tao],
TBN:
Convolutional Neural Network with Ternary Inputs and Binary Weights,
ECCV18(II: 322-339).
Springer DOI
1810
BibRef
Shen, F.M.[Fu-Min],
Liu, W.[Wei],
Zhang, S.T.[Shao-Ting],
Yang, Y.[Yang],
Shen, H.T.[Heng Tao],
Learning Binary Codes for Maximum Inner Product Search,
ICCV15(4148-4156)
IEEE DOI
1602
Binary codes
BibRef
Heo, J.P.[Jae-Pil],
Lin, Z.[Zhe],
Yoon, S.E.[Sung-Eui],
Distance Encoded Product Quantization for Approximate K-Nearest
Neighbor Search in High-Dimensional Space,
PAMI(41), No. 9, Sep. 2019, pp. 2084-2097.
IEEE DOI
1908
Distortion, Encoding, Indexes, Vector quantization, Search problems,
Estimation, Vector quantization, nearest neighbor search,
high-dimensional search
BibRef
An, S.[Shan],
Huang, Z.B.[Zhi-Biao],
Bai, S.[Shuang],
Che, G.F.[Guang-Fu],
Ma, X.[Xin],
Luo, J.[Jie],
Chen, Y.[Yu],
Quarter-Point Product Quantization for approximate nearest neighbor
search,
PRL(125), 2019, pp. 187-194.
Elsevier DOI
1909
Approximate nearest neighbor, Quarter point, Codeword expansion
BibRef
Muñoz, J.V.[Javier Vargas],
Gonçalves, M.A.[Marcos A.],
Dias, Z.[Zanoni],
da Silva Torres, R.[Ricardo],
Hierarchical Clustering-Based Graphs for Large Scale Approximate
Nearest Neighbor Search,
PR(96), 2019, pp. 106970.
Elsevier DOI
1909
Approximate nearest neighbors search, Graph-based search,
Hierarchical clustering, Guided search
BibRef
Fan, B.[Bin],
Kong, Q.Q.[Qing-Qun],
Zhang, B.Q.[Bao-Qian],
Liu, H.M.[Hong-Min],
Pan, C.H.[Chun-Hong],
Lu, J.W.[Ji-Wen],
Efficient nearest neighbor search in high dimensional hamming space,
PR(99), 2020, pp. 107082.
Elsevier DOI
1912
Binary feature, Feature matching,
Approximate nearest neighbor search, Scalable image matching
BibRef
Sieranoja, S.[Sami],
Fränti, P.[Pasi],
Fast and general density peaks clustering,
PRL(128), 2019, pp. 551-558.
Elsevier DOI
1912
Data clustering, Density peaks, k-nearest neighbors (kNN), Large-scale data
BibRef
Malkov, Y.A.[Yu A.],
Yashunin, D.A.,
Efficient and Robust Approximate Nearest Neighbor Search Using
Hierarchical Navigable Small World Graphs,
PAMI(42), No. 4, April 2020, pp. 824-836.
IEEE DOI
2003
Graph and tree search strategies, artificial intelligence,
information search and retrieval,
similarity search
BibRef
Gui, J.[Jie],
Cao, Y.[Yuan],
Qi, H.[Heng],
Li, K.Q.[Ke-Qiu],
Ye, J.P.[Jie-Ping],
Liu, C.[Chao],
Xu, X.W.[Xiao-Wei],
Fast kNN Search in Weighted Hamming Space With Multiple Tables,
IP(30), 2021, pp. 3985-3994.
IEEE DOI
2104
Hamming distance, Search problems, Databases, Binary codes, Indexes,
Big Data applications, Table lookup, Hashing,
multiple tables
BibRef
Gallego, A.J.[Antonio Javier],
Rico-Juan, J.R.[Juan Ramón],
Valero-Mas, J.J.[Jose J.],
Efficient k-nearest neighbor search based on clustering and adaptive
k values,
PR(122), 2022, pp. 108356.
Elsevier DOI
2112
-Nearest Neighbor, Efficient search, Clustering, Feature learning
BibRef
Cao, Y.[Yuan],
Liu, J.W.[Jun-Wei],
Qi, H.[Heng],
Gui, J.[Jie],
Li, K.Q.[Ke-Qiu],
Ye, J.P.[Jie-Ping],
Liu, C.[Chao],
Scalable Distributed Hashing for Approximate Nearest Neighbor Search,
IP(31), 2022, pp. 472-484.
IEEE DOI
2112
Distributed databases, Hash functions, Costs,
Computational modeling, Binary codes, Analytical models,
approximate nearest neighbor search
BibRef
Zhao, W.L.[Wan-Lei],
Wang, H.[Hui],
Ngo, C.W.[Chong-Wah],
Approximate k-NN Graph Construction: A Generic Online Approach,
MultMed(24), No. 2022, pp. 1909-1921.
IEEE DOI
2204
Measurement, Quantization (signal), Indexing, Task analysis,
Nearest neighbor methods, Approximation algorithms, NN-descent
BibRef
Noh, H.[Haechan],
Kim, T.[Taeho],
Heo, J.P.[Jae-Pil],
Product Quantizer Aware Inverted Index for Scalable Nearest Neighbor
Search,
ICCV21(12190-12198)
IEEE DOI
2203
Quantization (signal), Databases, Nearest neighbor methods,
Distortion, Linear programming, Encoding,
BibRef
Bicego, M.[Manuele],
Orozco-Alzate, M.[Mauricio],
PowerHC: non linear normalization of distances for advanced nearest
neighbor classification,
ICPR21(1205-1211)
IEEE DOI
2105
Pattern classification, Pattern recognition, Tuning, Standards
BibRef
Tavallali, P.,
Tavallali, P.,
Khosravi, M.R.,
Singhal, M.,
Interpretable Synthetic Reduced Nearest Neighbor:
An Expectation Maximization Approach,
ICIP20(1921-1925)
IEEE DOI
2011
Optimization, Linear programming, Convergence, Complexity theory,
Machine learning algorithms, Machine learning,
EM algorithm
BibRef
García, V.[Vicente],
Sánchez, J.S.[Josep Salvador],
Ochoa-Ortiz, A.[Alberto],
López-Najera, A.[Abraham],
Instance Selection for the Nearest Neighbor Classifier:
Connecting the Performance to the Underlying Data Structure,
IbPRIA19(I:249-256).
Springer DOI
1910
BibRef
Zhang, J.L.[Jia-Liang],
Li, J.[Jing],
Khoram, S.[Soroosh],
Efficient Large-Scale Approximate Nearest Neighbor Search on OpenCL
FPGA,
CVPR18(4924-4932)
IEEE DOI
1812
System-on-chip, Quantization (signal), Graphics processing units,
Field programmable gate arrays, Databases, Table lookup, Micromechanical devices
BibRef
Iscen, A.[Ahmet],
Chum, O.[Ondrej],
Local Orthogonal-Group Testing,
ECCV18(II: 460-476).
Springer DOI
1810
Approximate NN search.
BibRef
Baranchuk, D.[Dmitry],
Babenko, A.[Artem],
Malkov, Y.[Yury],
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest
Neighbors,
ECCV18(XII: 209-224).
Springer DOI
1810
BibRef
Chen, Y.T.[Yi-Ting],
Tu, W.C.[Wei-Chih],
Chien, S.Y.[Shao-Yi],
SRIANN: Sphere Ring Intersection for Approximate Nearest Neighbor
Search in Videos,
ICIP18(3563-3567)
IEEE DOI
1809
Instruction sets, Videos, Graphics processing units,
Real-time systems, Databases, Approximation algorithms, Parallel processing
BibRef
Cao, Z.J.[Zhang-Jie],
Long, M.S.[Ming-Sheng],
Wang, J.M.[Jian-Min],
Yu, P.S.[Philip S.],
HashNet: Deep Learning to Hash by Continuation,
ICCV17(5609-5618)
IEEE DOI
1802
Approximate nearest neighbor.
binary codes, information retrieval,
learning (artificial intelligence), multimedia computing,
Training
BibRef
Yandex, A.B.,
Lempitsky, V.,
AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding,
ICCV17(4895-4903)
IEEE DOI
1802
feature extraction, graph theory, image coding, image retrieval,
learning (artificial intelligence), optimisation,
Topology
BibRef
Komorowski, M.[Michal],
Trzcinski, T.[Tomasz],
Random Binary Search Trees for Approximate Nearest Neighbour Search in
Binary Space,
PReMI17(473-479).
Springer DOI
1711
BibRef
Figueroa, K.[Karina],
Paredes, R.[Rodrigo],
Camarena-Ibarrola, J.A.[J. Antonio],
Reyes, N.[Nora],
Fixed Height Queries Tree Permutation Index for Proximity Searching,
MCPR17(74-83).
Springer DOI
1706
Efficient nearest neighbor.
BibRef
Abu-Aisheh, Z.[Zeina],
Raveaux, R.[Romain],
Ramel, J.Y.[Jean-Yves],
Fast Nearest Neighbors Search in Graph Space Based on a
Branch-and-Bound Strategy,
GbRPR17(197-207).
Springer DOI
1706
BibRef
Feng, H.[Huan],
Mills, S.,
Eyers, D.,
Shen, X.L.[Xiao-Long],
Huang, Z.,
Optimal space subdivision for parallel approximate nearest neighbour
determination,
ICVNZ15(1-6)
IEEE DOI
1701
computer vision
BibRef
Fu, X.P.[Xi-Ping],
McCane, B.[Brendan],
Mills, S.[Steven],
Albert, M.[Michael],
How to select hashing bits? A direct measurement approach,
ICVNZ15(1-6)
IEEE DOI
1701
binary codes
BibRef
Liu, X.L.[Xiang-Long],
Fan, X.J.[Xin-Jie],
Deng, C.[Cheng],
Li, Z.J.[Zhu-Jin],
Su, H.[Hao],
Tao, D.C.[Da-Cheng],
Multilinear Hyperplane Hashing,
CVPR16(5119-5127)
IEEE DOI
1612
BibRef
Douze, M.[Matthijs],
Jégou, H.[Hervé],
Perronnin, F.[Florent],
Polysemous Codes,
ECCV16(II: 785-801).
Springer DOI
1611
pproximate nearest neighbor search in the compressed domain
BibRef
Rodríguez-Torres, F.[Fredy],
Carrasco-Ochoa, J.A.[Jesús A.],
Martínez-Trinidad, J.F.[José Francisco],
Experimental Comparison of Oversampling Methods for Mixed Datasets,
MCPR21(78-88).
Springer DOI
2108
BibRef
Rodríguez-Torres, F.[Fredy],
Carrasco-Ochoa, J.A.[Jesús A.],
Martínez-Trinidad, J.F.[José Francisco],
SMOTE-D a Deterministic Version of SMOTE,
MCPR16(177-188).
Springer DOI
1608
BibRef
Feng, L.[Lu],
Xu, X.S.[Xin-Shun],
Guo, S.Q.[Shan-Qing],
Wang, X.L.[Xiao-Lin],
Supervised Class Graph Preserving Hashing for Image Retrieval and
Classification,
MMMod17(I: 391-403).
Springer DOI
1701
BibRef
Liang, X.L.[Xiao-Long],
Xu, X.S.[Xin-Shun],
Cui, L.Z.[Li-Zhen],
Guo, S.Q.[Shan-Qing],
Wang, X.L.[Xiao-Lin],
SOMH: A Self-Organizing Map Based Topology Preserving Hashing Method,
MMMod16(I: 337-348).
Springer DOI
1601
BibRef
Jiang, Z.S.[Zhan-Sheng],
Xie, L.X.[Ling-Xi],
Deng, X.T.[Xiao-Tie],
Xu, W.W.[Wei-Wei],
Wang, J.D.[Jing-Dong],
Fast Nearest Neighbor Search in the Hamming Space,
MMMod16(I: 325-336).
Springer DOI
1601
BibRef
Ben-Zrihem, N.[Nir],
Zelnik-Manor, L.[Lihi],
Approximate nearest neighbor fields in video,
CVPR15(5233-5242)
IEEE DOI
1510
matching patches of a video to a set of reference patches in real-time.
BibRef
Ju, Z.F.[Zhen-Fei],
Mao, X.J.[Xiao-Jiao],
Li, N.[Ning],
Yang, Y.B.[Yu-Bin],
Binary Code Learning via Iterative Distance Adjustment,
MMMod15(I: 83-94).
Springer DOI
1501
BibRef
Schmieder, F.[Fabian],
Yang, B.[Bin],
Locality Sensitive Hashing Using GMM,
GCPR14(569-581).
Springer DOI
1411
approximate nearest neighbor problem.
BibRef
Yang, H.C.[Hai-Chuan],
Bai, X.[Xiao],
Zhou, J.[Jun],
Ren, P.[Peng],
Zhang, Z.H.[Zhi-Hong],
Cheng, J.[Jian],
Adaptive Object Retrieval with Kernel Reconstructive Hashing,
CVPR14(1955-1962)
IEEE DOI
1409
Approximate nearest neighbor search; adaptive similarity; binary code
BibRef
Kostinger, M.[Martin],
Wohlhart, P.[Paul],
Roth, P.M.[Peter M.],
Bischof, H.[Horst],
Joint Learning of Discriminative Prototypes and Large Margin Nearest
Neighbor Classifiers,
ICCV13(3112-3119)
IEEE DOI
1403
Evaluation Time
BibRef
Iwamura, M.[Masakazu],
Sato, T.[Tomokazu],
Kise, K.[Koichi],
What is the Most EfficientWay to Select Nearest Neighbor Candidates
for Fast Approximate Nearest Neighbor Search?,
ICCV13(3535-3542)
IEEE DOI
1403
BibRef
Aiger, D.[Dror],
Kokiopoulou, E.[Efi],
Rivlin, E.[Ehud],
Random Grids: Fast Approximate Nearest Neighbors and Range Searching
for Image Search,
ICCV13(3471-3478)
IEEE DOI
1403
ANN; Image Search; Nearest Neighbors; Range Search
BibRef
Stommel, M.[Martin],
Edelkamp, S.[Stefan],
Wiedemeyer, T.[Thiemo],
Beetz, M.[Michael],
Fractal Approximate Nearest Neighbour Search in Log-Log Time,
BMVC13(xx-yy).
DOI Link
1402
BibRef
Drost, B.[Bertram],
Ilic, S.[Slobodan],
A Hierarchical Voxel Hash for Fast 3D Nearest Neighbor Lookup,
GCPR13(302-312).
Springer DOI
1311
BibRef
Liu, X.L.[Xiang-Long],
He, J.F.[Jun-Feng],
Deng, C.[Cheng],
Lang, B.[Bo],
Collaborative Hashing,
CVPR14(2147-2154)
IEEE DOI
1409
collaborative hashing;locality sensitive hashing;matrix hashing
BibRef
Liu, X.L.[Xiang-Long],
He, J.F.[Jun-Feng],
Chang, S.F.[Shih-Fu],
Hash Bit Selection for Nearest Neighbor Search,
IP(26), No. 11, November 2017, pp. 5367-5380.
IEEE DOI
1709
computational complexity,
feature selection, graph theory,
quadratic programming,
Naive selection methods, compact hashing,
edge-weighted graph, hash bit selection,
nearest neighbor search,
normalized dominant set problem,
vertex-weighted graph,
Binary codes, Heuristic algorithms,
Reliability,
bit complementarity, bit reliability,
hash bit selection, locality-sensitive hashing,
BibRef
Liu, X.L.[Xiang-Long],
He, J.F.[Jun-Feng],
Lang, B.[Bo],
Chang, S.F.[Shih-Fu],
Hash Bit Selection:
A Unified Solution for Selection Problems in Hashing,
CVPR13(1570-1577)
IEEE DOI
1309
hash bit selection. Nearest neighbor search for large datasets.
BibRef
Sergeev, N.[Nikolai],
A Supremum Norm Based Near Neighbor Search in High Dimensional Spaces,
ICCVG12(600-609).
Springer DOI
1210
BibRef
Xu, H.[Hao],
Wang, J.D.[Jing-Dong],
Li, Z.[Zhu],
Zeng, G.[Gang],
Li, S.P.[Shi-Peng],
Yu, N.H.[Neng-Hai],
Complementary hashing for approximate nearest neighbor search,
ICCV11(1631-1638).
IEEE DOI
1201
BibRef
Raniszewski, M.[Marcin],
Sequential Reduction Algorithm for Nearest Neighbor Rule,
ICCVG10(II: 219-226).
Springer DOI
1009
Training set size reduction.
BibRef
Brandt, J.[Jonathan],
Transform coding for fast approximate nearest neighbor search in high
dimensions,
CVPR10(1815-1822).
IEEE DOI
1006
BibRef
Min, K.[Kerui],
Yang, L.J.[Lin-Jun],
Wright, J.[John],
Wu, L.[Lei],
Hua, X.S.[Xian-Sheng],
Ma, Y.[Yi],
Compact projection: Simple and efficient near neighbor search with
practical memory requirements,
CVPR10(3477-3484).
IEEE DOI
1006
BibRef
Himei, N.[Noritaka],
Wada, T.[Toshikazu],
Approximate nearest neighbor search on HDD,
Emergent09(2101-2108).
IEEE DOI
0910
BibRef
Matsushita, Y.[Yusuke],
Wada, T.[Toshikazu],
Principal Component Hashing:
An Accelerated Approximate Nearest Neighbor Search,
PSIVT09(374-385).
Springer DOI
0901
BibRef
Jiang, X.H.[Xian-Hua],
Motai, Y.[Yuichi],
Snapp, R.R.[Robert R.],
Zhu, X.Q.[Xing-Quan],
Accelerated Kernel Feature Analysis,
CVPR06(I: 109-116).
IEEE DOI
0606
BibRef
Gomez-Ballester, E.[Eva],
Micó, L.[Luisa],
Oncina, J.[Jose],
A Pruning Rule Based on a Distance Sparse Table for Hierarchical
Similarity Search Algorithms,
SSPR08(926-936).
Springer DOI
0812
BibRef
Oncina, J.[Jose],
Thollard, F.[Franck],
Gómez-Ballester, E.[Eva],
Micó, L.[Luisa],
Moreno-Seco, F.[Francisco],
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search
Algorithms,
IbPRIA07(II: 306-313).
Springer DOI
0706
BibRef
Li, H.Y.[Hui-Ya],
Yeh, Y.J.[Yao-Jung],
Hwang, W.J.[Wen-Jyi],
Using Wavelet Transform and Partial Distance Search to Implement k NN
Classifier on FPGA with Multiple Modules,
ICIAR07(1105-1116).
Springer DOI
0708
BibRef
Yeh, Y.J.[Yao-Jung],
Li, H.Y.[Hui-Ya],
Hwang, W.J.[Wen-Jyi],
Fang, C.Y.[Chiung-Yao],
FPGA Implementation of k NN Classifier Based on Wavelet Transform and
Partial Distance Search,
SCIA07(512-521).
Springer DOI
0706
BibRef
Lou, Z.[Zhen],
Jin, Z.[Zhong],
Novel Adaptive Nearest Neighbor Classifiers Based On Hit-Distance,
ICPR06(III: 87-90).
IEEE DOI
0609
BibRef
Yang, S.[Shu],
Zhang, C.[Chao],
Regression Nearest Neighbor in Face Recognition,
ICPR06(III: 515-518).
IEEE DOI
0609
BibRef
Chou, C.H.[Chien-Hsing],
Kuo, B.H.[Bo-Han],
Chang, F.[Fu],
The Generalized Condensed Nearest Neighbor Rule as A Data Reduction
Method,
ICPR06(II: 556-559).
IEEE DOI
0609
BibRef
Lu, Z.M.[Zhe-Ming],
Burkhardt, H.[Hans],
Fast Image Retrieval Based on Equal-average Equal-variance K-Nearest
Neighbour Search,
ICPR06(II: 853-).
IEEE DOI
0609
BibRef
Mainar-Ruiz, G.[Gloria],
Perez-Cortes, J.C.[Juan-Carlos],
Approximate Nearest Neighbor Search using a Single Space-filling Curve
and Multiple Representations of the Data Points,
ICPR06(II: 502-505).
IEEE DOI
0609
BibRef
Snapp, R.R.[Robert R.],
Palau, A.M.[Alessandro M.],
The Labelled Cell Classifier:
A Fast Approximation to k Nearest Neighbors,
ICPR98(Vol I: 823-827).
IEEE DOI
9808
BibRef
Juan, A.[Alfons],
Aibar, P.,
Vidal, E.,
Fast k-Nearest-Neighbours Searching Through Extended Versions of the
Approximating and Eliminating Search Algorithm (AESA),
ICPR98(Vol I: 828-830).
IEEE DOI
9808
BibRef
Hofman, I.[Irving],
Jarvis, R.[Ray],
Robust and Efficient Cluster Analysis Using a
Shared Near Neighbours Approach,
ICPR98(Vol I: 243-247).
IEEE DOI
9808
BibRef
Skubalska-Rafajlowicz, E.,
Krzyzak, A.,
Fast K-NN Classification Rule Using Metrics on Space-Filling Curves,
ICPR96(II: 121-125).
IEEE DOI
9608
(Technical Univ. of Wroclaw, PL)
BibRef
Chapter on Pattern Recognition, Clustering, Statistics, Grammars, Learning, Neural Nets, Genetic Algorithms continues in
Neighborhood Graph Classification .