Discovering interesting information in XML data with association rules

Authors:
Daniele Braga;Alessandro Campi;Stefano Ceri;Mika Klemettinen;PierLuca Lanzi
Affiliations:
Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy;Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy;Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy;Nokia Research Center, Finland;Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy
Venue:
Proceedings of the 2003 ACM symposium on Applied computing
Year:
2003

Citing 4
Cited 9

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules

Advances in knowledge discovery and data mining
An Extension to SQL for Mining Association Rules

Data Mining and Knowledge Discovery
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering

An XML-enabled data mining query language: XML-DMQL

International Journal of Business Intelligence and Data Mining
Data and web management research at Politecnico di Milano

ACM SIGMOD Record
Bottom-up discovery of frequent rooted unordered subtrees

Information Sciences: an International Journal
Mining Tree-Based Frequent Patterns from XML

FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Mining flexible association rules from XML

Proceedings of the 2009 EDBT/ICDT Workshops
Logic-Based association rule mining in XML documents

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Complex association rules for XML documents

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
An XML-based database for knowledge discovery

EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
A structure preserving flat data format representation for tree-structured data

PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data mining algorithms are designed to extract interesting information from large amounts of data. They usually assume that source data are in relational (tabular) from. However, the recent success of XML as a standard to represent semi-structured data and the increasing amount of data available in XML pose new challenges to the data mining community. In this paper we introduce association rules for XML data. To accomplish this, we propose a new operator, based on XPath and inspired by the syntax of XQuery, which allows us to express complex mining tasks, compactly and intuitively. The operator can indifferently (and simultaneously) target both the content and the structure of the data, since the distinction in XML is slight.