Mining Tree-Based Frequent Patterns from XML

Mazuran, Mirjana; Quintarelli, Elisa; Tanca, Letizia

doi:10.1007/978-3-642-04957-6_25

Cited by 5 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our first proposal [22], we have used the PathJoin [35] algorithm to find frequent subtrees in XML documents. As will be shown in Section 5.2 such algorithm performed exponentially, therefore we have changed it and continued working with CMTreeMiner [7].…”

Section: The Treeruler Prototypementioning

confidence: 99%

See 1 more Smart Citation

Data Mining for XML Query-Answering Support

Mazuran

Quintarelli

Tanca

2012

IEEE Trans. Knowl. Data Eng.

Self Cite

View full text Add to dashboard Cite

Abstract-Extracting information from semistructured documents is a very hard task, and is going to become more and more critical as the amount of digital information available on the Internet grows. Indeed, documents are often so large that the data set returned as answer to a query may be too big to convey interpretable knowledge. In this paper, we describe an approach based on Tree-Based Association Rules (TARs): mined rules, which provide approximate, intensional information on both the structure and the contents of Extensible Markup Language (XML) documents, and can be stored in XML format as well. This mined knowledge is later used to provide: 1) a concise idea-the gist-of both the structure and the content of the XML document and 2) quick, approximate answers to queries. In this paper, we focus on the second feature. A prototype system and experimental results demonstrate the effectiveness of the approach.

show abstract

Section: The Treeruler Prototypementioning

confidence: 99%

“…Accordingly, the paper's contributions are . An improved version of the TARs extraction algorithm introduced in [22], which was based on PathJoin [35]. The new version uses the better performing CMTreeMiner [7] to mine frequent subtrees from XML documents.…”

mentioning

confidence: 99%

Data Mining for XML Query-Answering Support

Mazuran

Quintarelli

Tanca

2012

IEEE Trans. Knowl. Data Eng.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Paik et al in [3] propose to mine tree-based association rules in which two trees are disjunct. Mirjana et al in [4] describe an approach to extract tree-based association rules, in which the left side is an induced subtree of the right side. These rules provide approximate, intensional information on both the structure and the content of XML documents, and can be stored in XML format to be queried later on.…”

Section: Introductionmentioning

confidence: 99%

A Comparison of Association Rule Mining Methods for XML Data

Liu¹,

He²,

Ye³

2012

IJACT

View full text Add to dashboard Cite

With the increasing use of XML technology for data storage and data exchange, mining XML documents has become a researchable subject. This study makes a comparison of three association rule mining methods, the Apriori, FP-growth and AprioriSP, for mining XML data directly with using TinyXML, which is a XML parser implemented in the C++ language. The AprioriSP is proposed to find only short pattern frequent itemsets instead of all frequent ones in order to improve mining efficiency. Comparison experiments of performances of these three methods are performed on XML documents using different datasets and support levels.

show abstract

Mining association rules from XML document using modified index table

Sasikala¹,

Premalatha²

2013

2013 International Conference on Computer Communication and Informatics

View full text Add to dashboard Cite

In recent years the amount of unstructured databases increased drastically. In lieu of continuous increasing of XML databases, it is mandatory to propose a method to retrieve useful information. Association Rule Mining places a major role to retrieve this useful information. XML data bases have more challenges because of its inherent flexibility in structure and semantics. Many methods were suggested to mine association rules from these databases. In this paper a modified index table method is proposed to mine the interesting relationship among the XML documents. To accomplish the process more practical and computationally good, a modified index table is introduced. To show the effectiveness of this method a set of experiments are conducted on REED dataset and the results are discussed.

show abstract

Mining Tree-Based Frequent Patterns from XML

Cited by 5 publications

References 9 publications

Data Mining for XML Query-Answering Support

Data Mining for XML Query-Answering Support

A Comparison of Association Rule Mining Methods for XML Data

Mining association rules from XML document using modified index table

Contact Info

Product

Resources

About