Discovering attribute relationships, dependencies and rules by using rough sets
暂无分享,去创建一个
[1] Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .
[2] Wojciech Ziarko,et al. A METHOD FOR COMPUTING ALL MAXIMALLY GENERAL RULES IN ATTRIBUTE‐VALUE SYSTEMS , 1996, Comput. Intell..
[3] William Frawley,et al. Knowledge Discovery in Databases , 1991 .
[4] Jiawei Han,et al. An Attribute-Oriented Rough Set Approach for Knowledge Discovery in Databases , 1993, RSKD.
[5] Wojciech Ziarko,et al. Variable Precision Rough Sets with Asymmetric Bounds , 1993, RSKD.
[6] Gregory Piatetsky-Shapiro,et al. An Overview of Knowledge Discovery in Database: Recent Progress and Challenges , 1993, RSKD.
[7] Marzena Kryszkiewicz,et al. Finding Reducts in Composed Information Systems , 1993, RSKD.
[8] Andrzej Skowron,et al. The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.
[9] Jeffrey C. Schlimmer. Using learned dependencies to automatically construct sufficient and sensible editing views , 1993 .
[10] Zdzisław Pawlak,et al. Expressive power of knowledge representation , 1984 .
[11] Gregory Piatetsky-Shapiro,et al. Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.
[12] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.
[13] Ewa Orlowska,et al. Expressive Power of Knowledge Representation Systems , 1984, Int. J. Man Mach. Stud..
[14] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .
[15] C. J. V. Rijsbergen,et al. Rough Sets, Fuzzy Sets and Knowledge Discovery , 1994, Workshops in Computing.