Summary
The knowledge discovery in information systems, essentially, is to classify the objects according to attributes and to study the relation among those classes. Attribute reduction, which is to find a minimum attribute set that can keep the classification ability, is one of the most important problems in knowledge discovery in information system. The general method to study attribute reduction in information system is rough set theory, whose theoretical basis is the equivalence relation created on universe. Novotny. M. (1998) [17] has proposed a new idea to study attribute reduction by creating equivalence relation on attribute set. In this paper, we develop this idea to study attribute reduction through creating equivalence relations on attribute set and its power set.
This paper begins with the basis theory of information systems, including definitions of information systems, and equivalence relation R B on universe. Furthermore, two equivalence relations r and R are defined on attribute set and its power set separately. In the next section, two closed operators — C(R) and C(r) are created. Using these two operators, we get two corresponding closed set families — C R, C R, which are defined as C R = (B,C(R)(B) = B), C r = (B: C(r)(B) = B). Further, we study properties of these two closed set families, and prove that C R is a subset of C r. One of the most important result is the necessary and sufficient condition about C r=C R. This equivalence condition is described by elements of attribute set’s division. Finally, based on the equivalence proposition, we find an easy method to acquire attribute reduction when C r=C R. This method is easy to understand and use.
This work was supported by 973 Program of China (No. 2002CB312200).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
U. Fayyad, G. Piatetsky-Shapiro, and P. Smyth (1996) From Data Mining to Knowledge Discovery: An Overview. In: U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (eds) Advances in knowledge Discovery and Data Mining, MIT Press, Cambridge, Mass.
Pawlak Z (1991). Rough sets: Theoretical Aspects of Reasoning about Data. Boston: Kluwer Academic Publishers, Dordrecht.
Polkowski L, Lin T Y, Tsumoto S (Eds). Rough Set Methods and applications: New Developments in Knowledge Discovery in Information Systems. Heidelberg: Physica-Verlag.
Siddhartha B, Olivier V. Pictet, Gilles Z (2002) Knowledge-intensive genetic discovery in foreign exchange markets. IEEE Transaction, Evolutionary Computation. 6(2): 169–181.
Engelbert Mephu Nguifo, Vincent Duquenne, Michel Liquiere (2003) Introduction-Concept Lattice-Based Theory, Methods and Tools for Knowledge Discovery in Databases: Applications. Applied Artificial Intelligence. 17(3): 177–180.
K. J. Adams, D. A. Bell, Liam P. Maguire, J. McGregor (2003) Knowledge Discovery from Decision Tables by the Use of Multiple-Valued Logic. Artificial Intelligence Review. 19(2): 153–176.
U. Fayyad (1996) Data Mining and Knowledge Discovery: Making Sense Out of Data. IEEE Expert. 20–25.
T. Oyama, K. Kitano, Kenji Satou, T (2002) Extraction of knowledge on protein-protein interaction by association rule discovery. Bioinformatics. 18(5):705–714.
Kay Chen Tan, Q. Yu, C. M. Heng, T. H. Lee (2003) Evolutionary computing for knowledge discovery in medical diagnosis. Artificial Intelligence in Medicine. 27(2): 129–154.
Carolina Silva, Cirano Iochpe, Paulo Engel (2003) Using Knowledge Discovery to Identify Analysis Patterns for Geographic Database. ICEIS (2):359–364.
Kryszkiewicz M, Rybinski H (1993) Finding reducts in composed information systems. In: Ziarko W (eds) Rough Sets, Fuzzy Sets and Knowledge Discovery.
Wroblewski J (1995) Finding minimal reducts using genetic algorithms. In: Wang P P (eds) Proceedings of the International Workshop on Rough Sets Soft Computing at Second Annual Joint Conference on Information Science (JCIS’95), Wrighsville Beach, NC.
James F. Peters, Andrzej Skowron (2002) A rough set approach to knowledge discovery. International Journal Intelligence System. 17(2): 109–112.
Yasdi R (1995) Combining Rough Sets learning and neural learning method to deal with uncertain and imprecise information. Neurocomputing. 7(1):61–84.
Slowinski, R (1995) Rough set approach to decision analysis. AI Expert. 5:19–25.
Aijun A et al (1996) Discovering rules for water demand prediction-an enhanced rough set approach. Engineering Applications of Artificial Intelligence. 9(6):645–653.
Miroslav Novotny (1998) Dependence Spaces of Information Systems. In: E. Ortowska (eds) Incomplete Informations: Rough Set Analysis. Physica-Verlag.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, L., Zhang, W. (2005). Attribute Reduction Based on Equivalence Relation Defined on Attribute Set and Its Power Set. In: Monitoring, Security, and Rescue Techniques in Multiagent Systems. Advances in Soft Computing, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32370-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-32370-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23245-2
Online ISBN: 978-3-540-32370-9
eBook Packages: EngineeringEngineering (R0)