Abstract
Knowledge discovery in databases, or data mining, is an important objective in the development of data- and knowledge-base systems. An attribute-oriented rough set method is developed for knowledge discovery in databases. The method integrates learning from example techniques with rough set theory. An attribute-oriented concept tree ascension technique is first applied in generalization, which substantially reduces the computational complexity of the database learning processes. Then the rough set techniques are applied to the generalized relation to derive different knowledge rules. Moreover, the approach can find all the maximal generalized rules in the data. Based on these principles, a prototype database learning system, DBROUGH, has been constructed. Our study shows that attribute-oriented induction combined with rough set techniques provide an efficient and effective mechanism for knowledge discovery in database systems.
The authors are members of the Institute for Robotics and Intelligent Systems (IRIS) and wish to acknowledge the support of the Networks of Centers of Excellence Program of the Government of Canada, the Natural Sciences and Engineering Research Council, and the participation of PRECARN Associates Inc.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Cai, N. Cercone and J. Han, Attribute-Oriented Induction in Relational databases, Knowledge Discovery in Database, AAAI/MIT Press, G.Piatetsky-Shapiro and W.J. Frawley (eds) pp. 213–228, 1991.
T.G. Dietterich and R.S. Michalski, A Theory and Methodology of Inductive Learning, in Machine Learning: An Artificial Intelligence Approach, Vol. 1. Michalski et. al. (eds), Morgan Kaufmann, pp 43–82, 1983.
W. J. Frawley, G. Piatetsky and C.J. Matheus, Knowledge Discovery in Database: An Overview, Knowledge Discovery in Database, AAAI/MIT Press, G.Piatetsky-Shapiro and W.J. Frawley (eds), pp. 1–27, 1991.
Wojciech Ziarko, The Discovery, Analysis, and Representation of Data Dependencies in Databases, in Knowledge Discovery in Databases G. Piatetsky-Shapiro and W. J. Frawlwy, (eds) Menlo Park, CA: AAAI/MIT, 1990, 213–228
J. Han, Y.Cai, N. Cercone, Knowledge Discovery in Databases: An AttributeOriented Approach, Proceeding of the 18th VLDB Conference, Vancouver, B.C., Canada, pp 340–355, 1992
X. Hu, N. Cercone, J. Han, A Rough Set Approach for Knowledge Discovery in Databases, The International Workshop on Rough Set and Knowledge Discovery, Banff, Alberta, Canada, October 12–15, 1993. pp79–94
R.S. Mickalski, A Theory and Methodology of Inductive Learning, in Machine Learning: An Artificial Intelligence Approach, Vol. 1. Michalski et. al. (eds), Morgan Kaufmann, 1983, pp 41–82.
Zdzislaw Pawlak, Rough sets, International Journal of Information and Computer Science (1982) 11(5), 341–356
Zdzislaw Pawlak, Rough Classification, International Journal of Man-Machine Studies (1984) 20, 469–483
A. Silberschatz, M. Stonebraker and J.D. Ullman, Database Systems:Achievements and Opportunities, Comm. ACM, 34(10), 1991, pp. 94–109.
A. Skowron, C. Rauszer, The discernibility matrices and functions in information systems. ICS Research Report 1/91, Wawsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland
Wojciech Ziarko, Ning Shan, A Rough Set-Based Method for Computing All Minimal Determintic Rules on Attribute-Value Systems, Technical Report CS-93-02 Dept. of Computer Science, University of Regina, Canada
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, X., Shan, N., Cercone, N., Ziarko, W. (1994). DBROUGH: A rough set based knowledge discovery system. In: RaÅ›, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_39
Download citation
DOI: https://doi.org/10.1007/3-540-58495-1_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58495-7
Online ISBN: 978-3-540-49010-4
eBook Packages: Springer Book Archive