A prototype selection algorithm using fuzzy k-important nearest neighbor method
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Z.-X. | - |
dc.contributor.author | Tian, X.-W. | - |
dc.contributor.author | Lee, S.-H. | - |
dc.contributor.author | Lim, J.S. | - |
dc.date.available | 2020-02-29T00:47:20Z | - |
dc.date.created | 2020-02-12 | - |
dc.date.issued | 2013 | - |
dc.identifier.issn | 1876-1100 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/14892 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.relation.isPartOf | Lecture Notes in Electrical Engineering | - |
dc.subject | Classification accuracy | - |
dc.subject | Classification algorithm | - |
dc.subject | Data set | - |
dc.subject | K nearest neighbor (KNN) | - |
dc.subject | K nearest neighbor algorithm | - |
dc.subject | k-NN algorithm | - |
dc.subject | Nearest neighbor method | - |
dc.subject | Nearest neighbors | - |
dc.subject | Prototype selection | - |
dc.subject | Training sets | - |
dc.subject | Benchmarking | - |
dc.subject | Learning algorithms | - |
dc.title | A prototype selection algorithm using fuzzy k-important nearest neighbor method | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.doi | 10.1007/978-94-007-5860-5_120 | - |
dc.identifier.bibliographicCitation | Lecture Notes in Electrical Engineering, v.215 LNEE, pp.997 - 1001 | - |
dc.identifier.scopusid | 2-s2.0-84874138122 | - |
dc.citation.endPage | 1001 | - |
dc.citation.startPage | 997 | - |
dc.citation.title | Lecture Notes in Electrical Engineering | - |
dc.citation.volume | 215 LNEE | - |
dc.contributor.affiliatedAuthor | Tian, X.-W. | - |
dc.contributor.affiliatedAuthor | Lee, S.-H. | - |
dc.contributor.affiliatedAuthor | Lim, J.S. | - |
dc.type.docType | Conference Paper | - |
dc.subject.keywordAuthor | Fuzzy k-important nearest neighbor (FKINN) | - |
dc.subject.keywordAuthor | k-nearest neighbor (KNN) | - |
dc.subject.keywordAuthor | Prototype selection (PS) | - |
dc.subject.keywordPlus | Classification accuracy | - |
dc.subject.keywordPlus | Classification algorithm | - |
dc.subject.keywordPlus | Data set | - |
dc.subject.keywordPlus | K nearest neighbor (KNN) | - |
dc.subject.keywordPlus | K nearest neighbor algorithm | - |
dc.subject.keywordPlus | k-NN algorithm | - |
dc.subject.keywordPlus | Nearest neighbor method | - |
dc.subject.keywordPlus | Nearest neighbors | - |
dc.subject.keywordPlus | Prototype selection | - |
dc.subject.keywordPlus | Training sets | - |
dc.subject.keywordPlus | Benchmarking | - |
dc.subject.keywordPlus | Learning algorithms | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.