| Discovering interesting information in XML data with association rules |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 25, Citation Count: 3
|
|
|
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
|
Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
|
| |
3
|
Rakesh Agrawal , Hiekki Mannila , Ramakrishnan Srikant , Hannu Toivonen , A. Inkeri Verkamo, Fast discovery of association rules, Advances in knowledge discovery and data mining, American Association for Artificial Intelligence, Menlo Park, CA, 1996
|
| |
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
|
|
CITED BY 3
|
|
Stefano Ceri , Cristiana Bolchini , Daniele Braga , Marco Brambilla , Alessandro Campi , Sara Comai , Piero Fraternali , Pier Luca Lanzi , Marco Masseroli , Maristella Matera , Mauro Negri , Giuseppe Pelagatti , Giuseppe Pozzi , Elisa Quintarelli , Fabio A. Schreiber , Letizia Tanca, Data and web management research at Politecnico di Milano, ACM SIGMOD Record, v.36 n.4, December 2007
|
|
|
|
|
|
Yijun Bei , Gang Chen , Lidan Shou , Xiaoyan Li , Jinxiang Dong, Bottom-up discovery of frequent rooted unordered subtrees, Information Sciences: an International Journal, v.179 n.1-2, p.70-88, January, 2009
|
|