Abstract
In this paper, we propose a new framework, called XLogic- Miner, to mine association rules from XML data. We consider the generate-and-test and the frequent-pattern growth approaches. In XLogic-Miner, we propose an novel method to represent a frequent-pattern tree in an object-relational table and exploit a new join operator developed in the paper. The principal focus of this research is to demonstrate that association rule mining can be expressed in an extended datalog program and be able to mine XML data in a declarative way. We also consider some optimization and performance issues.
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
Tsur, D., Ullman, J.D., Abiteboul, S., Clifton, C., Motwani, R., Nestorov, S., Rosenthal, A.: Query flocks: A generalization of association-rule mining. In: Proceedings of ACM SIGMOD, pp. 1–12 (1998)
Rantzau, R.: Processing frequent itemset discovery queries by division and set containment join qperators. In: Proceedings of the 2003 ACM DMKD, pp. 20–27 (2003)
Braga, D., Campi, A., Ceri, S.: Discovering interesting information in xml data with association rules. In: Proceedings of ACM symposium on applied computing (2003)
Wan, J.W.W., Dobbie, G.: Mining association rule from xml data using xquery. In: Proceedings of the Fifth International Workshop on Web Information and Data Management (2003)
Feng, L., Dillon, T., Weigand, H., Chang, E.: An xml-enabled association rule framwork. In: MaÅ™Ãk, V., Å tÄ›pánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 88–97. Springer, Heidelberg (2003)
Zhang, S., Zhang, J., Liu, H., Wang, W.: Xar-miner: efficient association rules mining for xml data. In: Proceedings of ACM WWW 2005, pp. 894–895 (2005)
Jamil, H.M.: Ad hoc association rule mining as sql3 queries. In: Proceedings of IEEE international conference on data mining, pp. 609–612 (2001)
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD conference on management of data, pp. 207–216 (1993)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)
Jamil, H.M.: Mining first-order knowledge bases for association rules. In: Proceedings of 13th IEEE International conference on tools with Artificial intelligence (2001)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD Conference on Management of Data, pp. 1–12 (2000)
Masson, C., Robardet, C., Boulicaut, J.F.: Optimizing subset queries: a step towards sql-based inductive databases for itemsets. In: Proceedings of the 2004 ACM symposium on applied computing, pp. 535–539 (2004)
Liu, H.C., Yu, J.: Algebraic equivalences of nested relational operators. Information Systems 30, 167–204 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, HC., Zeleznikow, J., Jamil, H.M. (2006). Logic-Based Association Rule Mining in XML Documents. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds) Advanced Web and Network Technologies, and Applications. APWeb 2006. Lecture Notes in Computer Science, vol 3842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610496_11
Download citation
DOI: https://doi.org/10.1007/11610496_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31158-4
Online ISBN: 978-3-540-32435-5
eBook Packages: Computer ScienceComputer Science (R0)