A novel condensing tree structure for rough set feature selection

Neurocomputing

Volumn 71, Issue 4-6, 2008, Pages 1092-1100

  Yang, Ming ^a   Yang, Ping ^a  

^a NANJING NORMAL UNIVERSITY   (China)

Author keywords

C Tree; Discernibility matrix; Feature reduction; Rough set

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; ROUGH SET THEORY; TREES (MATHEMATICS);

CONDENSING TREE STRUCTURE; DISCERNIBILITY MATRIX; FEATURE REDUCTION; ROUGH SET FEATURE SELECTION;

FEATURE EXTRACTION;

ACCURACY; ALGORITHM; ARTICLE; CONTROLLED STUDY; EXPERIMENTAL DESIGN; INFORMATION SYSTEM; MATHEMATICAL COMPUTING; METHODOLOGY; PRIORITY JOURNAL; ROUGH SET;

EID: 38649088943     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2007.09.003     Document Type: Article

References (24)

1. U.M. Fayyad, L.P. Shapiro, P. Smyth, R. Uthurusamy, in: Menlo Park (Ed.), Advances in Knowledge Discovery and Data Mining, AAAI Press/The MIT Press, California, 1996.
2. Guan J.W., and Bell D.A. Rough computational methods for information systems [J]. Artif. Intell. 105 1-2 (1998) 77-103
3. K.M. Gupta, P.G. Moore, D.W. Aha, S.K. Pal, Rough set feature selection methods for case-based categorization of text documents, in: Proceedings of the First International Conference on Pattern Recognition and Machine Intelligence, Springer, Berliln, Kolkata, India, 2005, pp. 792-798.
4. K.M. Gupta, W.A. David, M. Philip, Rough set feature selection algorithms for textual case-based classification, in: T.R. Roth-Berghofer, et al. (Eds.), ECCBR 2006, Lecture Notes in Artificial Intelligence, vol. 4106, 2006, pp. 166-181.
5. J.W. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, USA, 2000, pp. 1-12.
6. Hu X.H., and Cercone N. Learning in relational databases: a rough set approach. Computat. Intell. Int. J. 11 2 (1995) 323-338
7. F. Hu, G.Y. Wang, H. Huang, Y. Wu, Incremental attribute reduction based on elementary sets, in: Proceedings of 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Lecture Notes in Computer Science, Regina, Canada, 2005, pp. 185-193.
8. Jensen R., and Shen Q. Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Trans. Knowl. Data Eng. 16 12 (2004) 1457-1471
9. R. Jensen, Q. Shen, A. Tuson, Finding rough set reducts with SAT, in: Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, Lecture Notes in Artificial Intelligence, vol., 3641, 2005, pp.194-203.
10. Jue W., and Ju W. Reduction algorithm based on discernibility matrix the ordered features method. J. Comput. Sci. Technol. 16 6 (2001) 489-504
11. Juzhen Dong, Ning Zhong, Setsuo Ohsuga, Using rough sets with heuristics for feature selection, in: N. Zhong, A. Skowron, S. Ohsuga (Eds.), RSFDGrC'99, Lecture Notes in Artificial Intelligence, vol. 1711, 1999, pp. 178-187.
12. Liu H., and Motoda H. Feature Selection for Knowledge Discovery and Data Mining (1998), Kluwer, Boston
13. Pawlak Z. Rough sets. Int. J. Inf. Comput. Sci. 11 5 (1982) 341-356
14. Qasem A. Al-Radaideh, Md Nasir Sulaiman, Mohd Hasan Selamat, Hamidah Ibrahim, Feature selection by ordered rough set based feature weighing, in: K.V. Andersen, J. Debenham, R. Wagner, (Eds.), DEXA 2005, Lecture Notes in Computer Science, vol. 3588, 2005, pp. 105-112.
15. Qing L. Rough Sets and Rough Reasoning (2001), Science Press, Beijing (in Chinese)
16. Skowron A., and Rauszer C. The discernibility matrices and functions in information systems. Intell. Decision Support (1992) 331-362
17. Starzyk J.A., Nelson D.E., and Sturtz K. A mathematical foundation for improved reduct generation in information systems. J. Knowl. Inf. Syst. 2 2 (2000) 131-146
18. Swiniarski R.W., and Skowron A. Rough set methods in feature selection and recognition. Pattern Recognition Lett. 24 (2003) 833-849
19. Wang G.Y. Rough Set Theory and Knowledge Acquisition (2001), Xi'an Jiaotong University Press, Xi'an (in Chinese)
20. J. Wroblewski, Finding minimal reducts using genetic algorithms, in: Second Annual Joint Conference on Information Sciences, 1995, pp. 186-189.
21. Yang M., and Sun Z.H. An incremental updating algorithm based on prefix general list for association rules. Chin. J. Comput. 26 10 (2003) 1318-1325 (in Chinese)
22. Yang M., and Sun Z.H. Improvement of discernibility matrix and the computation of a core. J. Fudan Univ. (Natural Science), CCML2004 43 5 (2004) 865-868 (in Chinese)
23. Yang M., Sun Z.H., and Song Y.Q. Fast updating of globally frequent itemsets. J. Software 15 8 (2004) 1189-1197 (in Chinese)
24. Yang M. An incremental updating algorithm of the computation of a core based on the improved discernibility matrix. Chin. J. Comput. 29 3 (2006) 407-413 (in Chinese)