Weigted-FP-tree based XML query pattern mining

Authors:
Mi Sug Gu;Jeong Hee Hwang;Keun Ho Ryu
Affiliations:
Database/BioInformatics Laboratory, Chungbuk National University;Department of Computer Science, Namseoul University;Database/BioInformatics Laboratory, Chungbuk National University
Venue:
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Year:
2010

Citing 7
Cited 0

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Mining Frequent Quer Patterns from XML Queries

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
An implementation of the FP-growth algorithm

Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Exploit sequencing to accelerate hot XML query pattern mining

Proceedings of the 2006 ACM symposium on Applied computing
FRACTURE mining: mining frequently and concurrently mutating structures from historical XML documents

Data & Knowledge Engineering - Special issue: WIDM 2004
A weighted common structure based clustering technique for XML documents

Journal of Systems and Software
Mining changes from versions of dynamic XML documents

KDXD'06 Proceedings of the First international conference on Knowledge Discovery from XML Documents

Quantified Score

Hi-index	0.00

Visualization

Abstract

According as XML data have been prevailing in many areas such as internet and public documentation, we need to research data mining algorithm to XML data. And many kinds of techniques have been researched to speed up the query performance about XML data. In this paper, therefore, as the method for speeding up the query performance we analyze the XML query pattern and propose Weighted- FP-growth algorithm extracting the similar XML query pattern fast. The proposed method is applied to XML query subtrees. And we experimented our method compared with the existing algorithm. And we showed the proposed method outperform the other methods and give the fast query result to the repeatedly occurring queries.