Improving performance of the k-nearest neighbor classifier by tolerant rough sets
暂无分享,去创建一个
Xiaoyong Du | Yongguang Bao | N. Ishii | N. Ishii | Xiaoyong Du | Y. Bao
[1] Ron Kohavi,et al. Data Mining using MLC , 1996 .
[2] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .
[3] Yiyu Yao,et al. Relational Interpretations of Neigborhood Operators and Rough Set Approximation Operators , 1998, Inf. Sci..
[4] Yiyu Yao,et al. Information tables with neighborhood semantics , 2000, SPIE Defense + Commercial Sensing.
[5] Ron Kohavi,et al. Data Mining Using MLC a Machine Learning Library in C++ , 1996, Int. J. Artif. Intell. Tools.
[6] Hiroshi Motoda,et al. Feature Selection for Knowledge Discovery and Data Mining , 1998, The Springer International Series in Engineering and Computer Science.
[7] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[8] Yong Wang,et al. Learning Feature Weights from Similarity Information , 1998, Int. J. Artif. Intell. Tools.
[9] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.
[10] Lawrence Davis,et al. Hybridizing the Genetic Algorithm and the K Nearest Neighbors Classification Algorithm , 1991, ICGA.
[11] Peter E. Hart,et al. Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.
[12] Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .
[13] Tony R. Martinez,et al. An Integrated Instance‐Based Learning Algorithm , 2000, Comput. Intell..
[14] Lawrence Davis,et al. A Hybrid Genetic Algorithm for Classification , 1991, IJCAI.