An Improved K-Nearest Neighbor Algorithm for Pattern Classification

This paper proposed a “Locally Adaptive K-Nearest Neighbor (LAKNN) algorithm” for pattern exploration problem to enhance the obscenity of dimensionality. To compute neighborhood local linear discriminant analysis is an effective metric which determines the local decision boundaries from centroid information. KNN is a novel approach which uses in many classifications problem of data mining and machine learning. KNN uses class conditional probabilities for unfamiliar pattern. For limited training data in high dimensional feature space this hypothesis is unacceptable due to disfigurement of high dimensionality. To normalize the feature value of dissimilar metrics, Standard Euclidean Distance is used in KNN which s misguide to find a proper subset of nearest points of the pattern to be predicted. To overcome the effect of high dimensionality LANN uses a new variant of Standard Euclidian Distance Metric. A flexible metric is estimated for computing neighborhoods based on Chi-squared distance analysis. Chi-squared metric is used to ascertains most significant features in finding k-closet points of the training patterns. This paper also shows that LANN outperformed other four different models of KNN and other machine-learning algorithm in both training and accuracy.

@article{Sultana2022,
  title     = {An Improved K-Nearest Neighbor Algorithm for Pattern Classification},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {8},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Zinnia Sultana and Ashifatul Ferdousi and Farzana Tasnim and Lutfun Nahar},
  doi       = {10.14569/IJACSA.2022.0130887},
  url       = {https://doi.org/10.14569/IJACSA.2022.0130887}
}