Abstract

K-Nearest Neighbor was one of the top ten algorithms data mining in the classification process. The low accuracy results in the K-Nearest Neighbor classification method was caused of this method used the system of majority vote which allowed the selection of outliers as the closest neighbors and in the distance model used as a method of determining similarity between data. In this process it is evident that local mean vector and harmonic distance can improve accuracy, where the highest increase in average accuracy obtained in the set data wine is equal to 6.29% and the highest accuracy increase for LMKNN is obtained in set data glass identification which is 16.18%. Based on the tests that had been conducted on all data sets used, it could be seen that the proposed method was able to provide a better value of accuracy than the value of accuracy produced by traditional K-Nearest Neighbor and LMKNN.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.