Towards scalable algorithms for discovering rough set reducts

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

Volumn 3100, Issue , 2004, Pages 120-143

  Kryszkiewicz, Marzena ^a   Cichoń, Katarzyna ^a,b  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048893752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27794-1_5     Document Type: Article

References (31)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in KDD. AAAI, Menlo Park, California (1996) 307-328
2. Bazan, J., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decision Tables. In: Proc. of ISMIS '94, Charlotte, USA. LNAI, Vol. 869, Springer-Verlag, (1994) 346-355
3. Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough Set Algorithms in Classification Problem. In: L. Polkowski, S. Tsumoto and T.Y. Lin (eds.): Rough Set Methods and Applications. Physica-Verlag, Heidelberg, New York (2000) 49-88
4. Jelonek, J., Krawiec, K., Stefanowski, J.: Comparative Study of Feature Subset Selection Techniques for Machine Learning Tasks. Proc. of IIS '98, Malbork, Poland (1998) 68-77
5. John, H.G., Kohavi, R., Pfleger, K.: Irrelevant Features and the Subset Selection Problem. In: Machine Learning: Proc. of the Eleventh International Conference, Morgan Kaufmann Publishers, San Francisco, CA, (1994) 121-129
6. Kohavi, R., Frasca, B.: Useful Feature Subsets and Rough Set Reducts. In: Proc. of the Third International Workshop on Rough Sets and Soft Computing, San Jose, CA (1994)
7. Kryszkiewicz, M.: The Algorithms of Knowledge Reduction in Information Systems, Ph.D. Thesis, Warsaw University of Technology, Institute of Computer Science (1994)
8. Kryszkiewicz, M., Rybinski, H.: Finding Reducts in Composed Information Systems. Fundamenta Informaticae Vol. 27, No. 2-3 (1996) 183-196
9. Kryszkiewicz, M.: Strong Rules in Large Databases. In: Proc. of IPMU' 98, Paris, France, Vol. 2 (1998) 1520-1527
10. Kryszkiewicz M., Rybinski H.: Knowledge Discovery from Large Databases using Rough Sets. In: Proc. of EUFIT '98, Aachen, Germany, Vol. 1 (1998) 85-89
11. Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems. International Journal of Intelligent Systems, Wiley, Vol. 16, No. 1 (2001) 105-120
12. Kryszkiewicz, M.: Rough Set Approach to Rules Generation from Incomplete Information Systems. In: The Encyclopedia of Computer Science and Technology. Marcel Dekker, Inc., New York, Vol. 44 (2001) 319-346
13. Kryszkiewicz, M., Cichoń K.: Scalable Methods of Discovering Rough Sets Reducts. ICS Research Report 28/2003, Warsaw University of Technology (2003)
14. Lin, T.Y.: Rough Set Theory in Very Large Databases. In: Proc. of CESA IMACS '96, Lille, France Vol. 2 (1996) 936-941
15. Modrzejewski, M.: Feature Selection using Rough Sets Theory. In: Proc. of the European Conference on Machine Learning (1993) 213-226
16. Nguyen, S.H., Skowron, A., Synak, P., Wróblewski, J.: Knowledge Discovery in Databases: Rough Set Approach. In: Proc. of IFSA '97, Prague, Vol. II (1997) 204-209
17. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Vol. 9 (1991)
18. Pawlak, Z., Skowron, A.: A Rough Set Approach to Decision Rules Generation, ICS Research Report 23/93, Warsaw University of Technology (1993)
19. Romanski, S., Operations on Families of Sets for Exhaustive Search, Given a Monotonic Boolean Function. In: Proc. of Intl' Conf. on Data and Knowledge Bases, Israel (1988)
20. Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Intelligent Decision Support: Handbook of Applications and Advances of Rough Sets Theory. Kluwer Academic Publishers (1992) 331-362
21. Skowron, A., Swiniarski, R.W.: Information Granulation and Pattern Recognition. In: S.K. Pal, L. Polkowski, A. Skowron (eds.): Rough-Neural Computing. Techniques for Computing with Words. Heidelberg: Springer-Verlag (2004)
22. Slezak, D.: Approximate Reducts in Decision Tables. In: Proc. of IPMU '96, Granada, Spain, Vol. 3 (1996) 1159-1164
23. Slezak, D.: Searching for Frequential Reducts in Decision Tables with Uncertain Objects. In: Proc. of RSCTC '98, Warsaw. Springer-Verlag, Berlin (1998) 52-59
24. Slowiński, R. (ed.): Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory. Kluwer Academic Publishers, Vol 11 (1992)
25. Stepaniuk, J.: Approximation Spaces, Reducts and Representatives. In: Skowron, A., Polkowski, L. (eds.): Rough Sets in Data Mining and Knowledge Discovery, Springer-Verlag, Berlin (1998)
26. Susmaga, R.: Experiments in Incremental Computation of Reducts. In: Skowron, A., Polkowski, L., (eds.): Rough Sets in Data Mining and Knowledge Discovery, Springer-Verlag, Berlin (1998)
27. Susmaga, R.: Parallel Computation of Reducts. In: Proc. of RSCTC '98, Warsaw. Springer-Verlag, Berlin (1998) 450-457
28. Susmaga, R.: Computation of Shortest Reducts. In: Foundations of Computing and Decision Sciences, Poznan, Poland, Vol. 2, No. 23 (1998)
29. Susmaga, R.: Effective Tests for Inclusion Minimality in Reduct Generation. In: Foundations of Computing and Decision Sciences, Vol. 4, No. 23 (1998) 219-240
30. Tannhäuser, M.: Efficient Reduct Computation. M.Sc. Thesis, Institute of Mathematics, Warsaw University, Warsaw (1994)
31. Wroblewski, J.: Finding Minimal Reducts Using Genetic Algorithms. In: Proc. of the 2nd Annual Join Conference on Information Sc., Wrightsville Beach, NC, (1995) 186-189