Knowledge reduction based on the equivalence relations defined on attribute set and its power set

One of the key problems of knowledge discovery is knowledge reduction. This paper proposes a new method for knowledge reduction in information systems. First, two families of closed sets C"r and C"R are defined, where r and R are equivalence relations defined on the attribute set and its power set, respectively. The properties of C"r and C"R are also discussed. The necessary and sufficient condition for C"r=C"R is then given and employed to construct an approach to attribute reduction in information systems. It is also proved that under the condition C"r=C"R, the proposed approach to knowledge reduction is equivalent to the well-accepted one in reference [W.X. Zhang, Y. Leung, W.Z. Wu, Information Systems and Knowledge Discovery, Science Publishing Company, Beijing, 2003].

[1]  Wei-Zhi Wu,et al.  Approaches to knowledge reductions in inconsistent systems , 2003, Int. J. Intell. Syst..

[2]  U. M. Feyyad.  Data mining and knowledge discovery: making sense out of data , 1996 .

[3]  S. Tsumoto,et al.  Rough set methods and applications: new developments in knowledge discovery in information systems , 2000 .

[4]  Francisco Herrera,et al.  Recent advancements of fuzzy sets: Theory and practice , 2006, Inf. Sci..

[5]  Wen-Xiu Zhang,et al.  A Novel Statistical Method on Decision Table Analysis , 2004, Australian Conference on Artificial Intelligence.

[6]  Paulo Martins Engel,et al.  Using Knowledge Discovery to Identify Analysis Patterns for Geographic Database , 2003, ICEIS.

[7]  Yanyong Guan,et al.  Set-valued information systems , 2006, Inf. Sci..

[8]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[9]  Nick Cercone,et al.  Discovering rules for water demand prediction: An enhanced rough-set approach☆ , 1996 .

[10]  Ramin Yasdi,et al.  Combining Rough Sets Learning- and Neural Learning-method to deal with uncertain and imprecise information , 1995, Neurocomputing.

[11]  Miroslav Novotný,et al.  Dependence Spaces of Information Systems , 1998 .

[12]  Wei-Zhi Wu,et al.  Knowledge reduction in random information systems via Dempster-Shafer theory of evidence , 2005, Inf. Sci..

[13]  Kenji Satou,et al.  Extraction of knowledge on protein-protein interaction by association rule discovery , 2002, Bioinform..

[14]  Z. Pawlak,et al.  Rough set approach to multi-attribute decision analysis , 1994 .

[15]  David A. Bell,et al.  Knowledge Discovery from Decision Tables by the Use of Multiple-Valued Logic , 2004, Artificial Intelligence Review.

[16]  Siddhartha Bhattacharyya,et al.  Knowledge-intensive genetic discovery in foreign exchange markets , 2002, IEEE Trans. Evol. Comput..

[17]  Tong Heng Lee,et al.  Evolutionary computing for knowledge discovery in medical diagnosis , 2003, Artif. Intell. Medicine.

[18]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[19]  Marzena Kryszkiewicz,et al.  Finding Reducts in Composed Information Systems , 1993, RSKD.

[21]  Engelbert Mephu Nguifo,et al.  Introduction concept lattice-based theory, methods and tools for knowledge discovery in databases: Applications , 2003, Appl. Artif. Intell..

[22]  Andrzej Skowron,et al.  A rough set approach to knowledge discovery , 2002, International Journal of Intelligent Systems.

[23]  J. Kacprzyk,et al.  Incomplete Information: Rough Set Analysis , 1997 .

[24]  Wei-Zhi Wu,et al.  Approaches to knowledge reduction based on variable precision rough set model , 2004, Inf. Sci..