Improving performance of the k-nearest neighbor classifier by tolerant rough sets

Proceedings of the 3rd International Symposium on Cooperative Database Systems for Advanced Applications, CODAS 2001

Volumn , Issue , 2001, Pages 167-171

  Bao, Yongguang ^a   Du, Xiaoyong ^b   Ishii, N ^a  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GENETIC ALGORITHMS; MOTION COMPENSATION; NEAREST NEIGHBOR SEARCH;

IMPROVING PERFORMANCE; K-NEAREST NEIGHBOR CLASSIFICATION; K-NEAREST NEIGHBOR CLASSIFIER; REAL-WORLD; SIMILARITY FUNCTIONS; SIMILARITY METRICS; TRAINING DATA;

ROUGH SET THEORY;

EID: 18544385721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CODAS.2001.945163     Document Type: Conference Paper

References (19)

1. Z.Pawlak. ROUGH SETS (Theoretical Aspects of Reasoning about Data),Kluwer (1991).
2. D. Nejman, "A Rough Sets Based Methods of Handwritten Numerals Classification," ICS Research Reports, No, 18, Warsaw University of Technology, Warsaw, 1994.
3. M. Kretowski and J. Stepaniuk, "Selection of Objects and Attributes : A Tolerance Rough Set Approach," ICS Research Reports, No. 54, Warsaw University of Technology, Warsaw, 1995.
4. H.Liu and H.Motoda, Feature Selection for Knowledge Discovery and Data Mining, Kluwer Academic Publishers) 1998).
5. T.M. Cover and P.E. Hart, "Nearest Neighbor Pattern classification", IEEE Transactions on Information Theory, Vol. 13, No.1, 1967, 21-27.
6. J.R. Quinlan. "Induction of Decision Trees", Machine Learning 1(1), 81-106, 1986.
7. J.R. Quinlan, C4.5:Programs for Machine Learning,, Morgan Kaufmann, 1993.
8. M.Mitchell. An introduction to Genetic Algorithms, The MIT Press, 1996.
9. Y.G.Bao, X.Y. Du and N. Ishii, "Using Rough Sets and Class Mutual Information for Feature Selection", 6th international Conference on soft computing, IIZUKA2000, 452-458.
10. Y. Wang and N. Ishii, "Learning Feature Weights from Similarity Information", International Journal on Artificial Intelligence Tools, Vol.7,No.1(1998) 31-41.
11. K.ohavi and D. Sommerfield, "Data Mining using MLC++", Tools with AI, 1996, 234-245.
12. T.Y.Lin, and Y.Y.Yao, "Mining Soft Rules Using Rough Sets and Nearest Neighborhoods", in: Proceeding of the Symposium on Modeling, Analysis and Simulation, Computational Engineering in Systems Applications (CESA'96), IMASACS Multi-conference, Lille, France, 9-12 July 1996, 1095-1100.
13. Y.Y.Yao, "Relational Interpretations of Neighborhood Operates and Rough Set Approximation Operators", Information Science 111 (1998), 239-259.
14. Y.Y.Yao, "Information Tables with Neighborhood Semantics", in Data Mining and Knowledge Discovery: Theory, Tools and technology II. Belur V. Dasarathy, editor, proceedings of SPIE Vol. 4057(2000), 108-116.
15. H.A. Guvenir and A.akkus, "Weighted K-Nearest Neighbor Classification on Feature Projections", in: proceeding of the 12th Intel. Symposium on Computer and Information Sciences(ISCIS'97), Antalya,Turkey, 1997,44-51.
16. J.D.Kelly and L.Davis. "A Hybrid Genetic Algorithm for Classification", in: proceeding of the 12th International joint Conference on Artificial Intelligence, 1991, 645-650.
17. J.D.Kelly and L.Davis, "Hybridizing the Genetic Algorithm and the K Nearest neighbors Classification Algorithm", in: proceeding of the 4th International Conference on genetic Algorithms, 1991, 377-383.
18. D. R. Wilson and T.R. Martinez, "An Integrated Instance-Based Learning Algorithm", Computational Intelligence, Volume 16, Number 1, 2000,pp. 1-28.
19. Wettschereck, Dietrich, and T.G. Dietterich. "An Experimental Comparison of Nearest-Neighborand Nearest-Hyperrectangle Algorithms", Machine Learning, 19:1,1995 5-28.