Authors:
R Raja Kumar,G. Kishor Kumar,K.Nageswara Reddy,P.Arun Babu,DOI NO:
https://doi.org/10.26782/jmcms.spl.5/2020.01.00003Keywords:
Nearest Neighbor Classification,Pattern Recognition,Classifier,Data Mining,Issues,Abstract
Nearest Neighbor Classification technique (NNC) is an elegant classifier in machine learning and its related fields like Artificial Intelligence, Machine Learning and Data Mining etc. It is simple and easy to understand classifier. However it has some issues. This paper presents overview of the problems which researchers face with the NNC and the reference are given tosolve issues.Refference:
I. C. W. Swonger, “Sample set condensation for a condensed nearest neighbor
decision rule for pattern recognition”, Front.Pattern Recognition, pp. 511–
519, 1972
II. F. J. S. Sanchez, “Prototype selection for nearest neighbor rule through
proximity graphs”, Pattern Recognition Lett., vol. 18(6), pp. 507–513, 1995.
III. G. Gates, “The reduced nearest neighbor rule”, IEEE Trans. Information
Theory, vol. vol IT-14, no. 3, pp. 431–33, 1972.
IV. I. Tomek, “Two modifications of cnn”, IEEE Trans. Syst.Man. Cybern., vol.
vol.SMC-6 no 11, pp. 769–772, 1972.
V. Keogh, Eamonn, A. Mueen “Curse of dimensionality”, Encyclopedia of
Machine Learning. Springer US, 257-258, 2011.
VI. K. R. Raja, P. Viswanath, C. S. Bindu,“A Cascaded Method to Reduce
theComputational Burden of Nearest Neighbor Classifier”, In Proceedings of
the First InternationalConference on Computational Intelligence and
Informatics, Springer, pp. 275-288, 2016.
VII. K. R. Raja, P. Viswanath, C. S. Bindu, “An Approach to Reduce the
Computational Burden of Nearest Neighbor Classifier”,Procedia Computer
Science Vol.:85, pp. 588-597, 2016.
VIII. K. R. Raja, P. Viswanath, C. S. Bindu, “A New Prototype Selection Method
for Nearest Neighbor Classificatio””, IEEE Transactions on Very Large
Scale Integration (VLSI) Systems, Vol.: 15, Issue: 3, pp: 338 – 345, 2007.
IX. K. R. Raja, P. Viswanath, C. S. Bindu, “Nearest Neighbor Classifiers:
Reducing the Computational Demands”, In Advanced Computing (IACC),
2016 IEEE 6th International Conference, pp. 45-50, 2016.
X. P. Hart, “The condensed nearest neighbor rule”, IEEE Trans. on Information
Theory, Vol.: IT-14, Issue: 3, pp. 515–516, 1968.
XI. P. Murphy, D. W. Aha, UCI repository of machine learning databases–a
machine readable repository, 1995.
XII. P. Viswanath, N. Murty, S. Bhatnagar, “Overlap pattern synthesis with an
efficientnearestneighbor classifier”, Pattern recognition, Vol. 38, Issue: 8,
pp. 1187–1195, 2005.
XIII. P. Viswanath, T. H. Sarma, “An improvement to k-nearest neighbor
classifier”,Recent Advances in Intelligent Computational Systems (RAICS),
IEEE, pp. 227–231, 2011.
XIV. R. O. Duda, P. E. Hart, D. G. Stork, Pattern classification. 2nd. Edition. New
York, 2002.
XV. V. S. Babu, P. Viswanath, “Weighted k-nearest leader classifier for large
data sets”, Pattern Recognition and Machine Intelligence, pp. 17– 24, 2007.
XVI. V. S. Devi, M. N. Murty, “An incremental prototype set building technique”,
Pattern Recognition, Vol.: 35, Issue: 2, 505-513, 2002.