K-nearest neighbors under possibility framework with optimizing parameters

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a new approach optimizing the parameters in the K-nearest neighbors under possibility framework (KNN-PF) which is based on the classical K-nearest neighbors algorithm within the possibility theory. The KNN-PF method has provided good results comparing to other methods. However, the efficiency of this method is based on its parameters values. Therefore, in order to make this approach more effectiveness, we have to determine the optimal or near-optimal parameters values by maximizing its accuracy classification. In this paper, a novel method was proposed using the powerful evolutionary algorithm Immune Genetic Algorithm (IGA) as an optimizing algorithm. Experiments are conducted based on some real-world datasets and the experimental results show that our proposed method is powerful with respect to the accuracy.

Cite

CITATION STYLE

APA

Saied, S., & Elouedi, Z. (2020). K-nearest neighbors under possibility framework with optimizing parameters. In Advances in Intelligent Systems and Computing (Vol. 940, pp. 354–364). Springer Verlag. https://doi.org/10.1007/978-3-030-16657-1_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free