Attribute reduction by partitioning the minimized discernibility function

International Journal of Innovative Computing, Information and Control

Volumn 7, Issue 5 A, 2011, Pages 2167-2186

  Kahramanli, Sirzat ^a   Hacibeyoglu, Mehmet ^a   Arslan, Ahmet ^a  

^a SELCUK UNIVERSITY   (Turkey)

Author keywords

Attribute reduction; Discernibility function; Feature selection; Functional partitioning

Indexed keywords

ATTRIBUTE REDUCTION; BASIC SOLUTIONS; CLASSIFICATION ACCURACY; DATA MINING ALGORITHM; DATA REPRESENTATIONS; DATA SETS; DISCERNIBILITY FUNCTION; DISJUNCTIVE NORMAL FORM; FEATURE SELECTION; FUNCTIONAL PARTITIONING; NP-HARD; NUMBER OF ITERATIONS; OPTIMALITY; PROBLEM SIZE; SEARCH SPACES; SPACE COMPLEXITY; SQUARE ROOTS;

CLASSIFICATION (OF INFORMATION); DATA MINING; FEATURE EXTRACTION; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS;

DATA REDUCTION;

EID: 79956104522     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. R. W. Swiniarski and A. Skowron, Rough set methods in feature selection and recognition, Pattern Recognition Letters, vol.24, no.6, pp.833-849, 2003.
2. H. Liu and L. Yu, Toward integrating feature selection algorithms for classication and clustering, IEEE Transactions on Knowledge and Dataset Engineering, vol.17, no.4, pp.491-502, 2005.
3. Y. Chen, J. Chang and C. Cheng, Forecasting IPO returns using feature selection and entropy-based rough sets, International Journal of Innovative Computing, Information and Control, vol.4, no.8, pp.1861-1875, 2008.
4. Y. Matsumoto and J. Watada, Knowledge acquisition from time series data through rough sets analysis, International Journal of Innovative Computing, Information and Control, vol.5, no.12(B), pp.4885-4897, 2009.
5. H. Sakai and M. Nakata, On rough sets based rule generation from tables, International Journal of Innovative Computing, Information and Control, vol.2, no.1, pp.13-31, 2006.
6. X. Liu, W. Wu and J. Hu, A method of fuzzy multiple attribute decision making based on rough sets, International Journal of Innovative Computing, Information and Control, vol.4, no.8, pp.2005-2010, 2008.
7. X. Pei and Y. Wang, An approximate approach to attribute reduction, International Journal of Information Technology, vol.12, no.4, 2006.
8. R. Jensen and Q. Shen, Semantics-preserving dimensionality reduction: Rough and fuzzy-rough based approaches, IEEE Transactions on Knowledge and Data Engineering, vol.16, no.12, pp.1457-1471, 2004.
9. J. Komorowski, L. Polkowski and A. Skowron, Rough Set: A Tutorial, http://folli.loria.fr/cds/1999/library/pdf/skowron.pdf, 1999.
10. Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishers, Boston, 1991.
11. http://archive.ics.uci.edu/ml/.
12. M. Inuiguchi and M. Tsurumi, Measures based on upper approximations of rough sets for analysis of attribute importance and interaction, International Journal of Innovative Computing, Information and Control, vol.2, no.1, pp.1-12, 2006.
13. R. Jensen and Q. Shen, Rough Set Based Feature Selection: A Review, http://cadair.aber.ac.uk/dspace/handle/2160/490, 2007.
14. A. Skowron and C. Rauszer, The discernibility matrices and functions in information systems, Fundamenta Informaticae, vol.15, no.2, pp.331-362, 1992.
15. A. Skowron, The rough sets theory and evidence theory, Fundamenta Informaticae, vol.13, pp.245-262, 1990.
16. R. K. Brayton, G. D. Hachtel, C. T. McMullen and A. Singiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, Boston, 1984.
17. M. Giovanni, Synthesis and Optimization of Digital Circuits, McCraw-Hill, New York, 1994.
18. A. Malik, R. K. Brayton, A. R. Newton and A. Sangiovanni-Vincentelli, Reduced offsets for minimization of binary-valued functions, IEEE Transactions on Computer-Aided Design, vol.10, no.4, pp.413-426, 1991.
19. X. Wang, Y. Jie, X. Teng, W. Xia and R. Jensen, Feature selection based on rough sets and particle swarm optimization, Pattern Recognition Letters, vol.28, pp.459-471, 2007.
20. M. A. Hall and G. Holmes, Benchmarking attribute selection techniques for discrete class data mining, IEEE Transactions on Knowledge and Data Engineering, vol.15, no.3, pp.1-16, 2003.
21. J. G. Bazan, A comparison of dynamic and non-dynamic rough set methods for extracting laws from decision tables, in Rough Sets in Knowledge Discovery 1: Methodology and Applications, L. Polkowski and A. Skowron (eds.), New York, Physica-Verlag, 1998.
22. J. G. Bazan, A. Skowron and P. Synak, Dynamic reducts as a tool for extracting laws from decision tables, Lecture Notes in Articial Intelligence, vol.869, pp.346-355, 1994.
23. W. Chen, S. Tseng and T. Hong, An efficient bit-based feature selection method, Expert Systems with Applications, vol.34, no.4, pp.2858-2869, 2008.
24. B. Crossingham, T. Marwala and M. Lagazio, Evolutionarily optimized rough sets partitions, ICIC Express Letters, vol.3, no.3(A), pp.241-246, 2009.
25. S. Tan, X. Cheng and H. Xu, An efficient global optimization approach for rough set based dimensionality reduction, International Journal of Innovative Computing, Information and Control, vol.3, no.3, pp.725-736, 2007.
26. A. Øhrn, J. Komorowski, A. Skowron and R. Synak, The design and implementation of a knowledge discovery toolkit based on rough sets: The Rosetta system, in Rough Sets in Knowledge Discovery 1: Methodology and Applications, L. Polkowski and A. Skowron (eds.), New York, Physica-Verlag, 1998.
27. D. S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences, vol.9, no.3, pp.256-278, 1974.
28. J. Wang, and J. Wang, Reduction algorithms based on discernibility matrix: The ordered attributes method, Journal of Computer Science & Technology, vol.16, no.6, pp.489-504, 2001.
29. J. A. Starzyk, D. E. Nelson and K. Sturtz, A mathematical foundation for improved reduct generation in information systems, Journal of Knowledge and Information Systems, vol.2, no.2, pp.131-146, 2000.
30. S. Vinterbo and A. Øhrn, Minimal approximate hitting sets and rule templates, International Journal of Approximate Reasoning, vol.25, no.2, pp.123-143, 2000.
31. Y. Yao and Y. Zhao, Discernibility matrix simplication for constructing attribute reducts, Information Sciences, vol.179, no.7, pp.867-882, 2009.
32. H. S. Nguyen, On the desision table with maximal number of reducts, Electronic Notes in Theoretical Computer Science, vol.82, no.4, 2003.
33. R. Johnsonbaugh and M. Schaefer, Algorithms, Pearson Prentice Hall, 2004.
34. A. He, Unsupervised Data Mining by Recursive Partitioning, Master Thesis, University of Cincinnati, 2002.
35. T. T. Lee, T. Y. Lo and J. Wang, An information-lossless decomposition theory of relational information systems, IEEE Transactions on Information Theory, vol.52, no.5, pp.1890-1903, 2006.
36. K. Zhao and J. Wang, A reduction algorithm meeting users requirements, Computer Science and Technology, vol.17, pp.578-593, 2002.
37. Y. Korshunov, The Mathematical Basics of the Cybernetics, Energiya Publishers, Moscow, 1980.