D. Song, W. Ru-Chuan, F. Xiong, and Y. Le-Chan
[1] G. Haibo, H. Wenxue, C. Jianxin, & X. Yonghong, Opti-mization of principal component analysis in feature extraction,Proc. 2007 IEEE Intl. Conf. on Mechatronics and Automation,2007, 3128–3132. [2] P. Baranyi, Y. Yam, C.T. Yang, & A. Varkonyi-Koczy, SVDbased reduction for subdivided rule bases, The Ninth IEEEIntl. Conf. on Fuzzy Systems, 2, 2000, 712–716. [3] Z. Pawlak, Rough set, International Journal of Computer andInformation Sciences, 11, 1982, 341–356. [4] X.H. Hu & C. Nick, Learning in relational databases: Arough set approach, International Journal of ComputationalIntelligence, 11 (2), 1995, 323–338. [5] L.Y. Zhai, L.P. Khoo, & S.C. Fok, Feature extraction usingrough set theory and genetic algorithms – an application forthe simplification of product quality evaluation, Computers &Industrial Engineering, 43, 2002, 661–676. [6] Z. Ni, F. Li, S. Yang, X. Liu, W. Zhang, & Q. Luo, Attributesreduction based on GA-CFS method, Intl. Conf. Web-AgeInformation Management, 2007, 868–875. [7] R. Jensen & Q. Shen, Finding rough set reducts with ant colonyoptimization, Proc. 2003 UK Workshop on ComputationalIntelligence, 2003, 15–22. [8] R. Jensen & Q. Shen, Fuzzy-rough data reduction with antcolony optimization, Fuzzy Sets and Systems, 149, 2005, 5–20. [9] A.R. Header, J. Wang, & M. Fukushima, Tabu search forattribution reduction in rough set theory, Soft Computing,9 (12), 2007, 909–918. [10] X. Wang, J. Yang, X. Teng, W. Xia, & R. Jensen, Featureselection based on rough sets and particle swarm optimization,Pattern Recognition Letters, 28, 2007, 459–471. [11] D. Ye, Z. Chen, & J. Liao, A new algorithm for minimum at-tribute reduction based on binary particle swarm optimizationwith vaccination, The Pacific-Asia Conf. Knowledge Discoveryand Data Mining, 2007, 1029–1036. [12] C. Ferreira, Gene expression programming: A new adaptivealgorithm for solving problems, Complex Systems, 13 (2), 2001,87–129. [13] UCI, http://www.ics.uci.edu/∼mlearn/MLRepository.html.
Important Links:
Go Back