Rough Set Extensions for Feature Selection

作者: Neil Mac Parthaláin

DOI:

关键词:

摘要: Rough set theory (RST) was proposed as a mathematical tool to deal with the analysis of imprecise, uncertain or incomplete information knowledge. It is of fundamental importance artificial intelligence particularly in areas knowledge discovery, machine learning, decision support systems, and inductive reasoning. At heart RST idea only employing contained within data, thus unlike many other methods, probability distribution assignments are not required. relies on concept indiscernibility group equivalent elements generate granules. These granules then used build structure approximate given concept. This framework has unsurprisingly proven successful for application task feature selection. Feature selection (FS) term problem selecting input attributes which are most predictive outcome. Unlike dimensionality reduction algorithms preserve original semantics features following reduction. been applied tasks which involve datasets that contain huge numbers features (in order tens thousands), would be impossible to process otherwise. Recent examples such problems include text processing web content classification. FS techniques have also small medium-sized datasets discover information-rich features. The rough sets resulted efficient algorithms. However, due granularity approximations generated by approach there often resulting level uncertainty. uncertainty usually ignored (by nature very fact it `uncertain'). In this thesis, number methods attempt use improve performance extensions thereof FS. approaches two domain where reduction high importance; mammographic image complex systems monitoring. utility demonstrated compared empirically several dimensionality techniques. In experimental evaluation sections, shown equal classification accuracy when results obtained from unreduced data. Based new fuzzy-rough approaches, further developments presented thesis. first these nearest neighbour classifier real-valued data. technique evaluated imaging application. Also, novel unsupervised reduces eliminating those considered redundant. Both mentioned above, UFRFS employed monitoring

参考文章(220)
Elaine P. M. de Sousa, Caetano Traina, Agma J. M. Traina, Leejay Wu, Christos Faloutsos, A fast and effective method to find correlations among attributes in databases Data Mining and Knowledge Discovery. ,vol. 14, pp. 367- 407 ,(2007) , 10.1007/S10618-006-0056-4
Chen Degang, Zhang Wenxiu, Daniel Yeung, E.C.C. Tsang, Rough approximations on a complete completely distributive lattice with applications to generalized rough sets Information Sciences. ,vol. 176, pp. 1829- 1848 ,(2006) , 10.1016/J.INS.2005.05.009
N. Mac Parthaláin, Q. Shen, On rough sets, their recent extensions, and applications Knowledge Engineering Review. ,vol. 25, pp. 365- 395 ,(2010) , 10.1017/S0269888910000263
Stephen A. Cook, The complexity of theorem-proving procedures symposium on the theory of computing. pp. 151- 158 ,(1971) , 10.1145/800157.805047
CHANGJING SHANG, QIANG SHEN, ROUGH FEATURE SELECTION FOR NEURAL NETWORK BASED IMAGE CLASSIFICATION International Journal of Image and Graphics. ,vol. 02, pp. 541- 555 ,(2002) , 10.1142/S0219467802000792
Pawan Lingras, Cedric Davies, None, Applications of Rough Genetic Algorithms computational intelligence. ,vol. 17, pp. 435- 445 ,(2001) , 10.1111/0824-7935.00156
Hussein Almuallim, Thomas G. Dietterich, Learning Boolean concepts in the presence of many irrelevant features Artificial Intelligence. ,vol. 69, pp. 279- 305 ,(1994) , 10.1016/0004-3702(94)90084-1
Liangjun Ke, Zuren Feng, Zhigang Ren, An efficient ant colony optimization approach to attribute reduction in rough set theory Pattern Recognition Letters. ,vol. 29, pp. 1351- 1357 ,(2008) , 10.1016/J.PATREC.2008.02.006
Renpu Li, Zheng-ou Wang, Mining classification rules using rough sets and neural networks European Journal of Operational Research. ,vol. 157, pp. 439- 448 ,(2004) , 10.1016/S0377-2217(03)00422-3
James M. Keller, Michael R. Gray, James A. Givens, A fuzzy K-nearest neighbor algorithm systems man and cybernetics. ,vol. 15, pp. 580- 585 ,(1985) , 10.1109/TSMC.1985.6313426