Abstract
Despite the growing popularity of semi-structured data such asWeb documents and bibliography data, most data mining researches have focused on databases containing well structured data like RDB or OODB. In this paper, we try to find useful association rules from semi-structured data. However, some aspects of semi-structured data are not appropriate for data mining tasks.
One problem is that semi-structured data contains some degree of irregularity and it does not have fixed schema known in advance. The lack of external schema information make it a very challenging task to use standard database access method or to apply the algorithms of rule mining. Therefore, schema discovering is considered to be necessary for rule mining.
Another problem of association rule mining is computing cost. If discovered schema pattern contains redundant attributes, they affect mining efficiency. Therefore, we try to feedback knowledge that obtained from the result of association rules to schema discovering. It means rule mining and schema discovering can give benefit to each other. In this way, by integrating knowledge of both rule mining and schema discovering, we can extract useful association rules from semi-structured data efficiently.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Blascheck “Object-Oriented Programming with Prototypes,” Springer-Verlag (1994).
K. Wang and H. Liu “Discovering Typical Structures of Documents: A Road Map Approach,” Proc. of 21st Annual International ACM SIGIR Conference on Research and Development in Information (1998).
R. Srikant and R. Agrawal “Mining Generalized Association Rules,” Proc. of 21st International Conference of Very Large Databases, pp.407–419 (1995).
K. Maruyama and K. Uehara “Mining Association Rules from Semi-Structured Data,” Proc. of 20th ICDCS Workshop on Knowledge Discovery and Data Mining in the WWW (2000).
U. Y. Nahm and R. J. Mooney “A Mutually Beneficial Integration of Data Mining and Information Extraction,” Proc. of 17th AAAI-00 (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maruyama, K., Uehara, K. (2000). Knowledge Integration of Rule Mining and Schema Discovering. In: Arikawa, S., Morishita, S. (eds) Discovery Science. DS 2000. Lecture Notes in Computer Science(), vol 1967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44418-1_31
Download citation
DOI: https://doi.org/10.1007/3-540-44418-1_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41352-3
Online ISBN: 978-3-540-44418-3
eBook Packages: Springer Book Archive