Covering with reducts - A fast algorithm for rule generation

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

Volumn 1424, Issue , 1998, Pages 402-407

  Wróblewski, Jakub ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATION TECHNIQUES; FAST ALGORITHMS; PARALLELIZATIONS; REAL APPLICATIONS; RULE GENERATION; RULES BASED; SET OF RULES; TRAINING DATA;

ROUGH SET THEORY;

EID: 84947782845     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69115-4_55     Document Type: Conference Paper

References (11)

1. Bazan J., Skowron A., Synak P., 1994. Dynamic reducts as a tool for extracting laws from decision tables, Proc. of the Symp. on Methodologies for Intelligent Systems, Charlotte, NC, October 16-19, 1994, Lecture Notes in Artificial Intelligence 869, Springer-Verlag, Berlin 1994, 346-355, also in: ICS Research Report 43/94,Warsaw University of Technology.
2. Bazan J., 1998. A Comparison of Dynamic and non-Dynamic Rough Set Methods for Extracting Laws from Decision Tables. In: L. Polkowski, A. Skowron (eds.). Rough Sets in Knowledge Discovery. Physica Verlag, 1998.
3. Goldberg D.E., 1989. GA in Search, Optimisation, and Machine Learning. Addison-Wesley.
4. Nguyen S. H., Skowron A., Synak P., Wróblewski J., 1997. Knowledge Discovery in Databases: Rough Set Approach. Proc. of The Seventh International Fuzzy Systems AssociationWorld Congress, vol. 2, pp. 204-209, IFSA97, Prague, Czech Republic.
5. Nguyen H. S., Nguyen S. H., 1998. Discretization Methods in Data Mining. In: L. Polkowski, A. Skowron (eds.). Rough Sets in Knowledge Discovery. Physica Verlag, 1998.
6. Øhrn A., Komorowski J., 1997. Rosetta - A rough set toolkit for analysis of data. Proc. of Third International Join Conference on Information Sciences (JCIS97), Durham, NC, USA, March 1 - 5, 3 (1997), pp. 403-407.
7. Pawlak Z., 1991. Rough sets: Theoretical aspects of reasoning about data. Kluwer: Dordrecht 1991.
8. Skowron A., Rauszer C., 1992. The Discernibility Matrices and Functions in Information Systems. In: R. Slowiński (ed.): Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory. Kluwer: Dordrecht 1992, pp. 331-362.
9. Wróblewski J., 1995. Finding minimal reducts using genetic algorithms. Proc. of the Second Annual Join Conference on Information Sciences, pp.186-189, September 28-October 1, 1995, Wrightsville Beach, NC. Also in: ICS Research report 16/95, Warsaw University of Technology
10. Wróblewski J., 1996. Theoretical Foundations of Order-Based Genetic Algorithms. Fundamenta Informaticae, vol. 28 (3, 4), pp. 423-430. IOS Press, 1996.
11. Wróblewski J., 1998. Genetic algorithms in decomposition and classification problem. In: L. Polkowski, A. Skowron (eds.). Rough Sets in Knowledge Discovery. Physica Verlag, 1998.