Fetching the paper…
Reading the bibliography…
The K-nearest neighbor (KNN) classifier is one of the simplest and most common classifiers, yet its performance competes with the most complex classifiers in the literature.
Jaccard, P. (1901). Etude comparative de la distribution florale dans une portion des Alpes et du Jura
1901
Earlier work this paper cites.
Hellinger, E. E. (1909). Neue Begründung der Theorie quadratischer Formen von unendlichvielen Veränderlichen. für die reine und angewandte Mathematik, 136, 210–271
1909
Earlier work this paper cites.
Bhattachayya, A. (1943). On a measure of divergence between two statistical population defined by their population distributions. Bulletin Calcutta Mathematical Society, 35, 99–109
1943
Earlier work this paper cites.
Dice, L. R. (1945). Measures of the amount of ecologic association between species. Ecology, 26 (3), 297–302
1945
Earlier work this paper cites.
Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1 (6), 80–83
1945
Earlier work this paper cites.
Jeffreys, H. (1946). An invariant form for the prior probability in estimation problems. In Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences (Vol. 186, pp. 453–461)
1946
Earlier work this paper cites.
Sorensen, T. (1948). A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons. Biol. Skr., 5, 1–34
1948
Earlier work this paper cites.
Neyman, J. (1949). Contributions to the theory of the χ \chi 2 test. in proceedings of the first Berkeley symposium on mathematical statistics and probability
1949
Earlier work this paper cites.
Fix, E. and Hodges, J.L. (1951). Discriminatory analysis. Nonparametric discrimination; consistency properties. Technical Report 4, USAF School of Aviation Medicine, Randolph Field, TX, USA, 1951
1951
Earlier work this paper cites.
Kullback, S., & Leibler, R. A. (1951). On information and sufficiency. The annals of mathematical statistics, 22 (1), 79–86
1951
Earlier work this paper cites.
Clark, P. J. (1952). An extension of the coefficient of divergence for use with multiple characters. Copeia, 1952 (2), 61–64
1952
Earlier work this paper cites.
Whittaker, R. H. (1952). A study of summer foliage insect communities in the Great Smoky Mountains. Ecological monographs, 22 (1), 1–44
1952
Earlier work this paper cites.
Euclid. (1956). The Thirteen Books of Euclid’s Elements. Courier Corporation
1956
Earlier work this paper cites.
Hamming, R. W. (1958). Error detecting and error correcting codes. Bell System technical journal, 131 (1), 147–160
1958
Earlier work this paper cites.
Williams, W. T., & Lance, G. N. (1966). Computer programs for hierarchical polythetic classification (“similarity analyses"). The Computer, 9 (1), 60–64
1966
Earlier work this paper cites.
Cover, T., & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13 (1), 21–27
1967
Earlier work this paper cites.
Lance, G. N., & Williams, W. T. (1967). Mixed-data classificatory programs I - Agglomerative systems. Australian Computer Journal, 1 (1), 15–20
1967
Earlier work this paper cites.
Orloci, L. (1967). An agglomerative method for classification of plant communities. Journal of Ecology , 55(1), 193–206
1967
Earlier work this paper cites.
Hart, P. (1968). The condensed nearest neighbour rule. IEEE Transactions on Information Theory, 14, 515–516
1968
Earlier work this paper cites.
Sibson, R. (1969). Information radius. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 14 (2), 149–160
1969
Earlier work this paper cites.
Gates, G. (1972). The reduced nearest neighbour rule. IEEE Transactions on Information Theory, 18, 431–433
1972
Earlier work this paper cites.
Hedges, T. (1976). An empirical modification to linear wave theory. Proc. Inst. Civ. Eng., 61, 575–579
1976
Earlier work this paper cites.
Arya, S., & Mount, D. M. (1993). Approximate nearest neighbor queries in fixed dimensions. 4th annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms
1993
Earlier work this paper cites.
Taneja, I. J. (1995). New developments in generalized information measures. Advances in Imaging and Electron Physics, 91, 37–135
1995
Earlier work this paper cites.
Alpaydin, E. (1997). Voting over multiple condensed nearest neighbors. Artificial Intelligence Review, 11, 115–132
1997
Earlier work this paper cites.
Wettschereck, D., Aha, D. W., & Mohri, T. (1997). A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms. Artificial Intelligence Review, 11 (1-5), 273–314
1997
Earlier work this paper cites.
Willett, P., Barnard, J. M., & Downs, G. M. (1998). Chemical similarity searching. Journal of chemical information and computer sciences , 38 (6), 983–996
1998
Earlier work this paper cites.
Kubat, M., & Cooperson, Jr., M. (2000). Voting nearest-neighbour subclassifiers. Proceedings of the 17th International Conference on Machine Learning (ICML), (pp. 503–510). Stanford, CA, USA
2000
Earlier work this paper cites.
Topsoe, F. (2000). Some inequalities for information divergence and related measures of discrimination. IEEE Transactions on information theory, 46 (4), 1602–1609
2000
Earlier work this paper cites.
Wilson, D. R., & Martinez, T. R. (2000). Reduction techniques for exemplar-based learning algorithms. Machine learning, 38 (3), 257–286
2000
Earlier work this paper cites.
Yang, Y., Ault, T., Pierce, T., & Lattimer, C. W. (2000). Improving text categorization methods for event tracking. In Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval (pp. 65–72)
2000
Earlier work this paper cites.
Shannon, C. E. (2001). A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review, 3–55
2001
Cited alongside, same era.
Macklem, M. (2002). Multidimensional Modelling of Image Fidelity Measures. Burnaby, BC, Canada: Simon Fraser University
2002
Cited alongside, same era.
Hatzigiorgaki, M., & Skodras, A. (2003). Compressed domain image retrieval: a comparative study of similarity metrics. Proceedings of SPIE 5150 , 439-448
2003
Cited alongside, same era.
Zhu, X., & Wu, X. (2004). Class noise vs. attribute noise: A quantitative study. Artificial Intelligence Review, 22 (3), 177–210
2004
Cited alongside, same era.
Bajramovic, F., Mattern, F., Butko, N., & Denzler, J. (2006). A comparison of nearest neighbor search algorithms for generic object recognition. In Advanced Concepts for Intelligent Vision Systems (pp. 1186–1197). Springer
Kataria, A., & Singh, M. D. (2013). A Review of data classification Using K-nearest neighbour Algorithm. International Journal of Emerging Technology and Advanced Engineering, 3 (6), 354–360
2013
Later among the works it cites.
Lichman, M. (2013). Retrieved from UC Irvine Machine Learning Repository: http://archive.ics.uci.edu/ml
2013
Later among the works it cites.
Rubner, Y., & Tomasi, C. (2013). Perceptual metrics for image database navigation. Springer
2013
Later among the works it cites.
Saez, J. A., Galar, M., Luengo, J., & Herrera, F. (2013). Tackling the problem of classification with noisy data using multiple classifier Systems: Analysis of the performance and robustness. Information Sciences, 247, 1–20
2013
Later among the works it cites.
Szmidt, E. (2013). Distances and similarities in intuitionistic fuzzy sets. Springer
2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
Cha, S.-H. (2007). Comprehensive survey on distance/similarity measures between probability density functions. International Journal of Mathematical Models and Methods in Applied Sciences, 1(4), 300–307
2007
Cited alongside, same era.
Gan, G., Ma, C., & Wu, J. (2007). Data clustering: Theory, algorithms, and applications. SIAM
2007
Cited alongside, same era.
Pinto, D., Benedi, J.-M., & Rosso, P. (2007). Clustering narrow-domain short texts by using the Kullback-Leibler distance. International Conference on Intelligent Text Processing and Computational Linguistics, 611–622
2007
Cited alongside, same era.
Chetty, M., Ngom, A., & Ahmad, S. (2008). Pattern Recognition in Bioinformatics. Springer
2008
Cited alongside, same era.
Jirina, M., & Jirina, M. J. (2008). Classifier based on inverted indexes of neighbors. Institute of Computer Science. Academy of Sciences of the Czech Republic
2008
Cited alongside, same era.
Wu, X., Kumar, V., Quinlan, J. R., Ghosh, J., Yang, Q., Motoda, H., et al. (2008). Top 10 algorithms in data mining. Knowledge and information systems, 14 (1), 1–37
2008
Cited alongside, same era.
Xiubo, G., Tie-Yan, L., Qin, T., Andrew, A., Li, H., & Shum, H.-Y. (2008). Query dependent ranking using k-nearest neighbor. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (pp. 115–122)
2008
Cited alongside, same era.
Later among the works it cites.
Garcia, S., Luengo, J., & Herrera, F. (2014). Data preprocessing in data mining. Springer
2014
Later among the works it cites.
Hassanat, A. B. (2014). Dimensionality invariant similarity measure. Journal of American Science, 10 (8), 221–26
2014
Later among the works it cites.
Hassanat, A. B. (2014). Solving the problem of the k parameter in the KNN classifier using an ensemble learning approach. International Journal of Computer Science and Information Security, 12 (8), 33–39
2014
Later among the works it cites.
Hassanat, A. B., Abbadi, M. A., Altarawneh, G. A., & Alhasanat, A. A. (2014). Solving the problem of the k parameter in the KNN classifier using an ensemble learning approach. International Journal of Computer Science and Information Security, 12 (8), 33–39
2014
Later among the works it cites.
Premaratne, P. (2014). Human computer interaction using hand gestures. Springer
2014
Later among the works it cites.
Alkasassbeh, M., Altarawneh, G. A., & Hassanat, A. B. (2015). On enhancing the performance of nearest neighbour classifiers using Hassanat distance metric. Canadian Journal of Pure and Applied Sciences, 9 (1), 3291–3298
2015
Later among the works it cites.
Chomboon, K., Pasapichi, C., Pongsakorn, T., Kerdprasop, K., & Kerdprasop, N. (2015). An empirical study of distance metrics for k-nearest neighbor algorithm. In The 3rd International Conference on Industrial Application Engineering 2015 (pp. 280–285)
2015
Later among the works it cites.
Lopes, N., & Ribeiro, B. (2015). On the Impact of Distance Metrics in Instance-Based Learning Algorithms. Iberian Conference on Pattern Recognition and Image Analysis (pp. 48–56). Springer
2015
Later among the works it cites.
Punam, M., & Nitin, T. (2015). Analysis of distance measures using k-nearest. International Journal of Science and Research, 7 (4), 2101–2104
2015
Later among the works it cites.
Shirkhorshidi, A. S., Aghabozorgi, S., & Wah, T. Y. (2015). A Comparison Study on Similarity and Dissimilarity Measures in Clustering Continuous Data. PloS one, 10 (12), e0144059
2015
Later among the works it cites.
Todeschini, R., Ballabio, D., & Consonni, V. (2015). Distances and other dissimilarity measures in chemometrics. Encyclopedia of Analytical Chemistry
2015
Later among the works it cites.
Maillo, J., Triguero, I., & Herrera, F. (2015). A mapreduce-based k-nearest neighbor approach for big data classification. In Trustcom/BigDataSE/ISPA, (pp. 167–172). IEEE
2015
Later among the works it cites.
Abbad, A., & Tairi, H. (2016). Combining Jaccard and Mahalanobis Cosine distance to enhance the face recognition rate. WSEAS Transactions on Signal Processing, 16, 171–178
2016
Later among the works it cites.
Hu, L.-Y., Huang, M.-W., Ke, S.-W., & Tsai, C.-F. (2016). The distance function effect on k-nearest neighbor classification for medical datasets. SpringerPlus, 5 (1), 1304
2016
Later among the works it cites.
Lindi, G. A. (2016). Development of face recognition system for use on the NAO robot. Stavanger University, Norway
2016
Later among the works it cites.
Todeschini, R., Consonni, V., Grisoni, F. G., & Ballabio, D. (2016). A new concept of higher-order similarity and the role of distance/similarity measures in local classification methods. Chemometrics and Intelligent Laboratory Systems, 157, 50–57
2016
Later among the works it cites.
Deng, Z., Zhu, X., Cheng, D., Zong, M., & Zhang, S. (2016). Efficient kNN classification algorithm for big data. Neurocomputing, 195, 143-148
2016
Later among the works it cites.
Maillo, J., Ramírez, S., Triguero, I., & Herrera, F. (2017). kNN-IS: An Iterative Spark-based design of the k-Nearest Neighbors classifier for big data. Knowledge-Based Systems, 117, 3-15
2017
Closest in time.
Hassanat, A. B. (2018). Norm-Based Binary Search Trees for Speeding Up KNN Big Data Classification. Computers, 7(4), 54
2018
Closest in time.
Hassanat, A. B. (2018). Two-point-based binary search trees for accelerating big data classification using KNN. PloS one, 13(11), e0207772
2018
Closest in time.
Hassanat, A. B. (2018). Furthest-Pair-Based Decision Trees: Experimental Results on Big Data Classification. Information, 9(11), 284
2018
Closest in time.
Hassanat, A. B. (2018). Furthest-pair-based binary search tree for speeding big data classification using k-nearest neighbors. Big Data, 6(3), 225-235
2018
Closest in time.
Gallego, A. J., Calvo-Zaragoza, J., Valero-Mas, J. J., & Rico-Juan, J. R. (2018). Clustering-based k-nearest neighbor classification for large-scale data with neural codes representation. Pattern Recognition, 74, 531-543
2018
Closest in time.
Wang, F., Wang, Q., Nie, F., Yu, W., & Wang, R. (2018). Efficient tree classifiers for large scale datasets. Neurocomputing, 284, 70-79
2018
Closest in time.
Zheng, Y., Guo, Q., Tung, A. K., & Wu, S. (2016). LazyLSH: Approximate nearest neighbor search for multiple distance functions with a single index. International Conference on Management of Data (pp. 2023–2037). ACM
2037
Closest in time.