Abstract
This paper defines a kind of rule, functional dependency rule. The functional dependency degree of relational database can be depicted by this kind of rule. We give a algorithm to mine this kind of rule and prove some theorem to ensure the high efficiency and the correction of the algorithm. At last, we point some experiment result to support our conclusion.
Project supported by the National Natural Science Foundation of China and the National Doctoral Subject Foundation
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M.S. Chen, J. Han, and P.S. Yu, “Data Mining: An Overview from a Database Perspective”, IEEE Transactions on Knowledge and Data Engineering, 8(6): 866–883, 1996.
R. Agrawal, K. Shim: “Developing Tightly-Coupled Data Mining Applications on a Relational Database System”, Proc. of the 2nd Int’l Conference on Knowledge Discovery in Databases and Data Mining, Portland, Oregon, August, 1996.
D. Fisher. Improving inference through conceptual clustering. In Proc. 1987 AAAI Conf., pages 461–465, Seattle, Washington, July 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tao, X., Wang, N., Zhou, S., Zhou, A., Hu, Y. (1999). Mining Functional Dependency Rule of Relational Database. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_71
Download citation
DOI: https://doi.org/10.1007/3-540-48912-6_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65866-5
Online ISBN: 978-3-540-48912-2
eBook Packages: Springer Book Archive