{"title":"Improving multi-class classification: scaled extensions of harmonic mean-based adaptive k-nearest neighbors","authors":"Mustafa Açıkkar, Selçuk Tokgöz","doi":"10.1007/s10489-024-06109-2","DOIUrl":null,"url":null,"abstract":"<div><p>This paper proposes a novel extension of the harmonic mean-based adaptive <i>k</i>-nearest neighbors (<i>HMAKNN</i>) algorithm, called scaled <i>HMAKNN</i> (<i>SHMAKNN</i>), which builds on <i>HMAKNN</i>’s strengths to achieve improved multi-class classification accuracy. <i>HMAKNN</i> uses a modified voting mechanism based on the harmonic mean and adaptive <i>k</i>-value selection to address issues like the sensitivity to <i>k</i>-value selection and the limitations of majority voting. <i>SHMAKNN</i> further improves the decision process by adjusting the components of the harmonic mean, focusing on voting values and the average distances of each class label. Additionally, <i>SHMAKNN</i> applies a re-scaling process to adjust the distances of the nearest neighbors within a specific range, enhancing the consistency of distances at different scales. These improvements help align the elements of the harmonic mean more effectively, leading to a balanced and less biased classification process. The study utilized 26 benchmark datasets, carefully curated to ensure accuracy and consistency, selected from diverse domains to evaluate the proposed method on real-world problems. These datasets were chosen to represent challenges like noise, imbalance, and sparsity, ensuring robustness in handling common data complexities. Additionally, small to medium-sized datasets were used to reduce computational burden and allow for efficient evaluation. The evaluation results show that the proposed <i>SHMAKNN</i> models outperform existing methods in both <i>accuracy</i> and <i>F1-score</i> for datasets with four or more classes. Specifically, <i>SHMAKNN</i> achieved the highest average <i>accuracy</i> and <i>F1-score</i> (86.36% and 86.16%) compared to <i>HMAKNN</i> (86.10% and 85.74%) and traditional <i>k</i>-nearest neighbors (84.87% and 84.69%). The performance improvements were validated using Friedman’s test at a significance level of 0.05, confirming their statistical significance of the results. Consequently, the findings indicate that the proposed algorithm exhibits remarkable performance, thereby confirming its reliability and validity in the context of real-world applications, particularly those involving multiple classes.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 2","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-024-06109-2","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
This paper proposes a novel extension of the harmonic mean-based adaptive k-nearest neighbors (HMAKNN) algorithm, called scaled HMAKNN (SHMAKNN), which builds on HMAKNN’s strengths to achieve improved multi-class classification accuracy. HMAKNN uses a modified voting mechanism based on the harmonic mean and adaptive k-value selection to address issues like the sensitivity to k-value selection and the limitations of majority voting. SHMAKNN further improves the decision process by adjusting the components of the harmonic mean, focusing on voting values and the average distances of each class label. Additionally, SHMAKNN applies a re-scaling process to adjust the distances of the nearest neighbors within a specific range, enhancing the consistency of distances at different scales. These improvements help align the elements of the harmonic mean more effectively, leading to a balanced and less biased classification process. The study utilized 26 benchmark datasets, carefully curated to ensure accuracy and consistency, selected from diverse domains to evaluate the proposed method on real-world problems. These datasets were chosen to represent challenges like noise, imbalance, and sparsity, ensuring robustness in handling common data complexities. Additionally, small to medium-sized datasets were used to reduce computational burden and allow for efficient evaluation. The evaluation results show that the proposed SHMAKNN models outperform existing methods in both accuracy and F1-score for datasets with four or more classes. Specifically, SHMAKNN achieved the highest average accuracy and F1-score (86.36% and 86.16%) compared to HMAKNN (86.10% and 85.74%) and traditional k-nearest neighbors (84.87% and 84.69%). The performance improvements were validated using Friedman’s test at a significance level of 0.05, confirming their statistical significance of the results. Consequently, the findings indicate that the proposed algorithm exhibits remarkable performance, thereby confirming its reliability and validity in the context of real-world applications, particularly those involving multiple classes.
期刊介绍:
With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance.
The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.