.png){kind=icon}
.png){kind=icon}
Return
Mining frequent patterns from XML data: Efficient algorithms and design trade-offs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.07.113.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
XML documents
Data mining
Frequent patterns
Partially-ordered trees
Induced and embedded subtrees
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W