Name
Abstract | ||
|---|---|---|
The k-Nearest Neighbor (KNN) algorithm is widely used as a simple and effective classification algorithm. While its main advantage is its simplicity, its main shortcoming is its computational complexity for large training sets. A Prototype Selection (PS) method is used to optimize the efficiency of the algorithm so that the disadvantages can be overcome. This paper presents a new PS algorithm, namely Fuzzy k-Important Nearest Neighbor (FKINN) algorithm. In this algorithm, an important nearest neighbor selection rule is introduced. When classifying a data set with the FKINN algorithm, the most repeated selection sample is defined as an important nearest neighbor. To verify the performance of the algorithm, five UCI benchmarking databases are considered. Experiments show that the algorithm effectively deletes redundant or irrelevant prototypes while maintaining the same level of classification accuracy as that of the KNN algorithm. © 2013 Springer Science+Business Media. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-94-007-5860-5_120 | Lecture Notes in Electrical Engineering |
Keywords | Field | DocType |
fuzzy k-important nearest neighbor (fkinn),k-nearest neighbor (knn),prototype selection (ps) | Nearest neighbour algorithm,k-nearest neighbors algorithm,Best bin first,Computer science,Fuzzy logic,Selection algorithm,Algorithm,Nearest-neighbor chain algorithm,Large margin nearest neighbor,Computational complexity theory | Conference |
Volume | Issue | ISSN |
215 LNEE | null | 18761119 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen-Xing Zhang | 1 | 6 | 4.13 |
| Xue-Wei Tian | 2 | 1 | 1.70 |
| Sang-hong Lee | 3 | 72 | 11.96 |
| Joon S. Lim | 4 | 99 | 12.15 |