Nearest neighbor classifier: Simultaneous editing and feature selection

被引:152
作者
Kuncheva, LI [1 ]
Jain, LC
机构
[1] Univ Wales, Sch Math, Bangor LL57 1UT, Gwynedd, Wales
[2] Univ S Australia, Mawson Lakes, SA 5095, Australia
关键词
editing for the nearest neighbor classifier (1-nn); feature selection; genetic algorithms (GAs);
D O I
10.1016/S0167-8655(99)00082-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nearest neighbor classifiers demand significant computational resources (time and memory). Editing of the reference set and feature selection are two different approaches to this problem. Here we encode the two approaches within the same genetic algorithm (GA) and simultaneously select features and reference cases. Two data sets were used: the SATIMAGE data and a generated data set. The GA was found to be an expedient solution compared to editing followed by feature selection, feature selection followed by editing, and the individual results from feature selection and editing. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1149 / 1156
页数:8
相关论文
共 18 条
[1]  
Chtioui Y, 1998, J SCI FOOD AGR, V76, P77, DOI 10.1002/(SICI)1097-0010(199801)76:1&lt
[2]  
77::AID-JSFA948&gt
[3]  
3.0.CO
[4]  
2-9
[5]  
DASARATHY B, 1990, NEARET NEIGHBOR NN N
[6]  
Hart P.E., 1973, Pattern recognition and scene analysis
[7]   CONDENSED NEAREST NEIGHBOR RULE [J].
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (03) :515-+
[8]   Feature selection: Evaluation, application, and small sample performance [J].
Jain, A ;
Zongker, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (02) :153-158
[9]   Nearest prototype classification: Clustering, genetic algorithms, or random search? [J].
Kuncheva, LI ;
Bezdek, JC .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 1998, 28 (01) :160-164
[10]   Fitness functions in editing k-NN reference set by genetic algorithms [J].
Kuncheva, LI .
PATTERN RECOGNITION, 1997, 30 (06) :1041-1049