C-Pruner: An improved instance pruning algorithm

被引:17
作者
Zhao, KP [1 ]
Zhou, SG [1 ]
Guan, JH [1 ]
Zhou, AY [1 ]
机构
[1] Fudan Univ, Dept Comp Sci & Engn, Shanghai 200433, Peoples R China
来源
2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS | 2003年
关键词
instance-based learning; kNN classification; instance pruning;
D O I
10.1109/ICMLC.2003.1264449
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Instance-based learning faces the problem of deciding which instances could be discarded in order to save computation and storage costs. For large instance bases classifier suffers from large memory requirements and slow response. And present noisy instances may deteriorate the classification accuracy. This paper analyzes the strength and weakness of some of the existing algorithms for instance pruning, and propose an improved method C-Pruner. Experiments over real-world datasets verify C-Pruner's superior to the existing methods in classification accuracy.
引用
收藏
页码:94 / 99
页数:6
相关论文
共 20 条
[1]   INSTANCE-BASED LEARNING ALGORITHMS [J].
AHA, DW ;
KIBLER, D ;
ALBERT, MK .
MACHINE LEARNING, 1991, 6 (01) :37-66
[2]  
[Anonymous], MACHINE LEARNING /
[3]   Advances in instance selection for instance-based learning algorithms [J].
Brighton, H ;
Mellish, C .
DATA MINING AND KNOWLEDGE DISCOVERY, 2002, 6 (02) :153-172
[4]  
CAMERONJONES RM, 1995, P 8 AUSTR JOINT C AR, P99
[5]   FINDING PROTOTYPES FOR NEAREST NEIGHBOR CLASSIFIERS [J].
CHANG, CL .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (11) :1179-1184
[6]  
Dasarthy B, 1991, NEAREST NEIGHBOR NN
[7]  
GATES GW, 1972, IEEE T INFORM THEORY, V18, P431, DOI 10.1109/TIT.1972.1054809
[8]   CONDENSED NEAREST NEIGHBOR RULE [J].
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (03) :515-+
[9]  
Kolodner J, 1993, CASE BASED REASONING
[10]  
Leake D. B., 2000, Advances in Case-Based Reasoning. 5th European Workshop, EWCBR 2000. Proceedings (Lecture Notes in Artificial Intelligence Vol.1898), P161