C-Pruner: An improved instance pruning algorithm

International Conference on Machine Learning and Cybernetics

Volumn 1, Issue , 2003, Pages 94-99

  Zhao, Ke Ping ^a   Zhou, Shui Geng ^a,b   Guan, Ji Hong ^b   Zhou, Ao Ying ^a  

^a FUDAN UNIVERSITY   (China)

^b WUHAN UNIVERSITY   (China)

Author keywords

Instance Pruning; Instance based learning; KNN classification

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTER SCIENCE; CYBERNETICS; DATA REDUCTION; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; SOFTWARE PROTOTYPING;

INSTANCE PRUNING; INSTANCE-BASED LEARNING; KNN CLASSIFICATION;

LEARNING SYSTEMS;

EID: 1542269102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Dasarathy B V. Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. Los Alamitos, CA: IEEE Computer Society Press. 1991.
2. Aha D., Kibler D., and Albert M., Instance-Based Learning Algorithms. Machine Learning, 6:37-66, 1991
3. Stanfill C, Waltz D. Toward memory-based reasoning. Communications of the ACM, 1986, 29(12): 1213-1228.
4. Kolodner J L. Case-based Reasoning. San Mateo, Calif.: Morgan Kaufmann, 1993.
5. Smyth B, McKenna E. Competence Guided Instance Selection for Case-Based Reasoning. Netherlands: Kluwer Academic Publishers. 2000: 1-18.
6. Leake D B, Wilson D C. Remembering Why to Remember: Performance-Guided Case-Base Maintenance. Proceedings of the 5th European Workshop on Case-Based Reasoning. Berlin: Springer-Verlag. 2000: 161-172.
7. Zhu Jun, Yang Qiang. Remember to add: competence-preserving case addition policies for case base maintenance. Dean T (Ed.): Proceedings of International Joint Conference in Artificial Intelligence 1999 (IJCAI-99), San Francisco: Morgan Kaufmann, 1999: 234-241.
8. Hart P E. The Condensed Nearest Neighbor Rule. IEEE Transactions on Information Theory, 1968, 14: 515-516.
9. Ritter G L, Woodruff H B, Lowry S R, et al. An Algorithm for a Selective Nearest Neighbor Decision Rule. IEEE Transactions on Information Theory, 1975, 21(6): 665-669.
10. Gates G W. The Reduced Nearest Neighbor Rule. IEEE Transactions on Information Theory, 1972, IT-18(3): 431-433.
11. Wilson, Dennis L. Asymptotic Properties of Nearest Neighbor Rules Using Edited Data. IEEE Transactions on Systems, Man, and Cybernetics, 1972, 2(3): 408-421.
12. Tomek I. An Experiment with the Edited Nearest-Neighbor Rule. IEEE. Transactions on Systems, Man, and Cybernetics. 1976, 6(6): 448-452.
13. Chang Chin-Liang. Finding Prototypes for Nearest Neighbor Classifiers. IEEE Transactions on Computers, 1974, 23(11): 1179-1184.
14. Domingos P. Rule Induction and Instance-Based Learning: A Unified Approach. The 1995 International Joint Conference on Artificial Intelligence (IJCAI-95), San Francisco: Morgan Kaufmann. 1995: 1226-1232
15. Cameron-Jones R M. Instance Selection by Encoding Length Heuristic with Random Mutation Hill Climbing. Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence, 1995: 99-106.
16. Zhang J. Selecting Typical Instances in Instance-Based Learning. Sleeman D, Edwards P (Eds.): Proceedings of the Ninth International Conference on Machine Learning (ICML'92), San Francisco: Morgan Kaufmann, 1992: 470-479.
17. Wilson D R, Martinez T R. Reduction techniques for instance-based learning algorithms. Machine Learning, 2000, 38(3): 257-286.
18. Brighton H, Mellish C S. Advances in instance selection for instance-based learning algorithms. Data Mining and Knowledge Discovery. 2002, 6(2): 153-172.
19. Merz C. J., and Murphy P. M., UCI Repository of Machine Learning Databases. Irvine, CA: University of California Irvine, Department of Information and Computer Science. Internet: http://www.ics.uci.us/~mlearn/M1Repository.html
20. Salzberg, S. A Nearest Hyperrectangle Learning Method. Machine Learning, 1991, vol. 6, 277-309.