Abstract
Measuring the structural similarity among XML documents is the task of finding their semantic correspondence and is fundamental to many web-based applications. While there exist several methods to address the problem, the data mining approach seems to be a novel, interesting and promising one. It explores the idea of extracting paths from XML documents, encoding them as sequences and finding the maximal frequent sequences using the sequential pattern mining algorithms. In view of the deficiencies encountered by ignoring the hierarchical information in encoding the paths for mining, a new sequential pattern mining scheme for XML document similarity computation is proposed in this paper. It makes use of a preorder tree representation (PTR) to encode the XML tree’s paths so that both the semantics of the elements and the hierarchical structure of the document can be taken into account when computing the structural similarity among documents. In addition, it proposes a postprocessing step to reuse the mined patterns to estimate the similarity of unmatched elements so that another metric to qualify the similarity between XML documents can be introduced. Encouraging experimental results were obtained and reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
ACM SIGMOD Record home page [http://www.acm.org/sigmod/record/xml]
Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the 11th international conference on data engineering (ICDE), Taipei, Taiwan, March, pp 3–14
Altinel M, Franklin MJ (2000) Efficient filtering of XML documents for selective dissemination of information. In: Proceedings of 26th international conference on very large data bases (VLDB), Cairo, Egypt, September, pp 53–64
Bunke H (1997) On a relation between graph edit distance and maximum common subgraph. Pattern Recogn Lett 18:689–694
Chan CY, Felber P, Garofalakis MN, Rastogi R (2002a) Efficient filtering of XML documents with XPath expressions. In: Proceedings of 18th international conference on data engineering (ICDE), San Jose, CA, February 26–March 1, pp 235–244
Chan CY, Felber P, Garofalakis M, Rastogi R (2002b) Tree pattern aggregation for scalable XML data dissemination. In: Proceedings of 28th international conference on very large data bases (VLDB), Hong Kong, China, August, pp 826–837
Chang CH, Lui SC, Wu YC (2001) Applying pattern mining to Web information extraction. In: Proceedings of the fifth Pacific-Asia conference on knowledge discovery and data mining (PAKDD), Hong Kong, China, April, pp 4–16
Galhardas H, Florescu D, Shasha D, Simon E, Saita CA (2002) Declarative data cleaning: language, model, and algorithms. In: Proceedings of 28th international conference on very large data bases (VLDB), Hong Kong, China, August, pp 371–380
Guha S, Jagadish HV, Koudas N, Srivastava D, Yu T (2002) Approximate XML joins. In: Proceedings of the ACM SIGMOD conference on management of data, Madison, WI, June, pp 287–298
Liefke H, Suciu D (2000) XMill: an efficient compressor for XML data. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, Dallas, TX, May, pp 153–164
IBM’s XML Generator homepage [http://www.alphaworks.ibm.com]
Lee JW, Lee K, Kim W (2001) Preparations for semantics-based XML mining. In: Proceedings of the 2001 IEEE international conference on data mining, San Jose, CA, December, pp 345–352
Meng W, Wang W, Sun H, Yu C (2002) Concept hierarchy based text database categorization. J Knowl Inf Syst 4(2):132–150
Miyahara T, Shoudai T, Uchida T, Takahashi K, Ueda H (2001) Discovery of frequent tree structured patterns in semi-structured Web documents. In: Proceedings of the Fifth Pacific-Asia conference on knowledge discovery and data mining (PAKDD), Hong Kong, China, April, pp 47–52
Miyahara T, Suzuki Y, Shoudai T, Uchida T, Takahashi K, Ueda H (2002) Discovery of frequent tag tree patterns in semistructured Web Documents. In: Proceedings of the sixth Pacific-Asia conference on knowledge discovery and data mining (PAKDD), Taipei, Taiwan, May, pp 341–355
Moh CH, Lim EP, Ng WK (2000) DTD-miner: a tool for mining DTD from XML documents. In: Proceedings of the 2nd international workshop on advance issues of e-commerce and web-based information systems, Milpitas, CA, June, pp 144–151
Nestorov S, Abiteboul S, Motwani R (1998) Extracting schema from semi-structured data. In: Proceedings of ACM SIGMOD international conference on management of data, Seattle, WA, June, pp 295–306
Nierman A, Jagadish HV (2002) Evaluating structural similarity in XML documents. In: Proceedings of the fifth international workshop on the Web and databases (WEDDB), Madison, WI, June
Pereira J, Fabret F, Jacobsen HA, Llirbat F, Shasha D (2001) WebFilter: a high-throughput XML-based publish and subscribe system. In: Proceedings of 27th international conference on very large data bases (VLDB), Roma, Italy, September, pp 723–724
Sedgewick R (1996) Chapter 5 trees, an introduction to the analysis of algorithms. Addison-Wesley, pp 221–298
W3C’s Document Object Model (DOM) home page [http://www.w3.org/DOM/]
W3C’s Extensible Markup Language (XML) home page [http://www.w3.org/XML/]
W3C’s Standard Generalized Markup Language (SGML) home page [http://www.w3.org/MarkUp/SGML/]
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Leung, Hp., Chung, Fl. & Chan, Sf. On the use of hierarchical information in sequential mining-based XML document similarity computation. Knowl Inf Syst 7, 476–498 (2005). https://doi.org/10.1007/s10115-004-0156-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-004-0156-7