Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Silva, Leandro A.a; b; c; * | de Vasconcelos, Bruno P.b; c | Del-Moral-Hernandez, Emiliod
Affiliations: [a] Faculdade de Computação e Informática, Brasil | [b] Programa de Pós-Graduação em Engenharia Elétrica e Computação, Brasil | [c] Universidade Presbiteriana Mackenzie, Brasil | [d] Escola Politécncia da Universidade de São Paulo, Brasil
Correspondence: [*] Corresponding author: Leandro A. Silva, Programa de Pós-Graduação em Engenharia e Computação Faculdade de Computação e Informática, Rua da Consolação, 930, São Paulo, Brasil. E-mail: [email protected].
Abstract: Due to the high accuracy of the K nearest neighbor algorithm in different problems, KNN is one of the most important classifiers used in data mining applications and is recognized in the literature as a benchmark algorithm. Despite its high accuracy, KNN has some weaknesses, such as the time taken by the classification process, which is a disadvantage in many problems, particularly in those that involve a large dataset. The literature presents some approaches to reduce the classification time of KNN by selecting only the most important dataset examples. One of these methods is called Prototype Generation (PG) and the idea is to represent the dataset examples in prototypes. Thus, the classification process occurs in two steps; the first is based on prototypes and the second on the examples represented by the nearest prototypes. The main problem of this approach is a lack of definition about the ideal number of prototypes. This study proposes a model that allows the best grid dimension of Self-Organizing Maps and the ideal number of prototypes to be estimated using the number of dataset examples as a parameter. The approach is contrasted with other PG methods from the literature based on artificial intelligence that propose to automatically define the number of prototypes. The main advantage of the proposed method tested here using eighteen public datasets is that it allows a better relationship between a reduced number of prototypes and accuracy, providing a sufficient number that does not degrade KNN classification performance.
Keywords: Classification algorithms, hybrid algorithms, Prototype Generation, Self-Organizing Maps, k Nearest Neighbor
DOI: 10.3233/IDA-205123
Journal: Intelligent Data Analysis, vol. 25, no. 2, pp. 321-338, 2021
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]