ACM Home Page
Please provide us with feedback. Feedback
Discovering interesting information in XML data with association rules
Full text PdfPdf (555 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2003 ACM symposium on Applied computing table of contents
Melbourne, Florida
SESSION: Data mining table of contents
Pages: 450 - 454  
Year of Publication: 2003
ISBN:1-58113-624-2
Authors
Daniele Braga  Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy
Alessandro Campi  Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy
Stefano Ceri  Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy
Mika Klemettinen  Nokia Research Center, Finland
PierLuca Lanzi  Politecnico di Milano, P.za L. da Vinci 32, I-20133, Milano, Italy
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 25,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/952532.952621
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
consortium on discovering knowledge with Inductive Queries (cInQ). http://www.cinq-project.org.
2
 
3
 
4
 
5
Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules. In Usama M. Fayyad and Ramasamy Uthurusamy, editors, Knowledge Discovery in Databases, Papers from the 1994 AAAI Workshop (KDD'94), pages 181--192. AAAI Press, 1994.
 
6
Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Discovering frequent episodes in sequences. In Usama M. Fayyad and Ramasamy Uthurusamy, editors, Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD'95), pages 210--215. AAAI Press, 1995.
 
7


Collaborative Colleagues:
Daniele Braga: colleagues
Alessandro Campi: colleagues
Stefano Ceri: colleagues
Mika Klemettinen: colleagues
PierLuca Lanzi: colleagues