Association reducts: Complexity and heuristics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4259 LNAI, Issue , 2006, Pages 157-164

  Ślȩzak, Dominik ^a,b  

^a UNIVERSITY OF REGINA   (Canada)

^b POLISH JAPANESE INSTITUTE OF INFORMATION TECHNOLOGY   (Poland)

Author keywords

Approximations; Associations; Attributes; Reducts

Indexed keywords

APPROXIMATION THEORY; DECISION THEORY; HEURISTIC METHODS; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

ASSOCIATION REDUCTS; DECISION REDUCTS; HEURISTIC MECHANISMS; INFORMATIVE ASSOCIATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 33845239486     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of assocation rules. In: Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press (1996) 307-328.
2. Grużdź, A., Ihnatowicz, A., Ślȩzak, D.: Interactive gene clustering - a case study of breast cancer microarray data. Information Systems Frontiers 8 (2006) 21-27.
3. Kloesgen, W., Żytkow, J.M. (eds): Handbook of Data Mining and Knowledge Discovery. Oxford University Press (2002).
4. Nguyen, H.S., Nguyen, S.H.: Rough Sets and Association Rule Generation. Fundamenta Informaticae 40/4 (1999) 310-318.
5. Nguyen, S.H., Nguyen, H.S.: Pattern extraction from data. Fundamenta Informaticae 34/1-2 (1998) 129-144.
6. Pawlak, Z.: Rough sets - Theoretical aspects of reasoning about data. Kluwer Academic Publishers (1991).
7. Polkowski, L.: Rough Sets: Mathematical Foundations. Physica Verlag (2002).
8. Polkowski, L., Tsumoto, S., Lin, T.Y. (eds): Rough Set Methods and Applications. Physica Verlag (2000).
9. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory. Kluwer Academic Publishers (1992) 311-362.
10. Ślȩzak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53/3-4 (2002) 365-390.
11. Ślȩzak, D.: Association Reducts: A Framework for Mining Multi-attribute Dependencies. In: Proc. of ISMIS'2005, Springer (2005) 354-363.
12. Ślȩzak, D.: Association Reducts: Boolean Representation. In: Proc. of RSKT'2006, Springer (2006) to appear.
13. Ślȩzak, D., Wróblewski, J.: Order-based genetic algorithms for the search of approximate entropy reducts. In: Proc. of RSFDGrC'2003, Springer (2003) 308-311.
14. Wróblewski, J.: Theoretical Foundations of Order-Based Genetic Algorithms. Fundamenta Informaticae 28/3-4 (1996) 423-430.
15. Wróblewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae 47/3-4 (2001) 351-360.