Mining frequent patterns from XML data: Efficient algorithms and design trade-offs
XML documents are now ubiquitous and their current applications are countless, from representing semistructured documents to being the de facto standard for exchanging information. Viewed as partially-ordered trees, XML documents are amenable to efficient data mining techniques. In this paper, we describe how scalable algorithms can be used to mine frequent patterns from partially-ordered trees and discuss the trade-offs that are involved in the design of such algorithms. (C) 2011 Elsevier Ltd. All rights reserved.
frequent patterns xml documents partially-ordered trees data mining induced and embedded subtrees