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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chen, L., Bhowmick, S.S., Chia, L.T.: Mining Maximal Frequently Changing Subtree Patternsfrom XML Documents. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2004. LNCS, vol. 3181, pp. 68–76. Springer, Heidelberg (2004)
Yang, L.H., Lee, M.L., Hsu, W., Acharya, S.: Mining Frequent Query Patterns from XML Queries. In: Proceedings of the Eighth International Conference on Database Systems for Advanced Applications, pp. 7695–1895 (2003)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (2000)
Borgelt, C.: An Implementation of the FP-growth Algorithm. In: OSDM 2005, Chicago, Illinoise, USA, August 21 (2005)
Rusu, L.H., Rahayu, W., Taniar, D.: Mining Changes from Versions of Dynamic XML Documents. In: Nayak, R., Zaki, M.J. (eds.) KDXD 2006. LNCS, vol. 3915, pp. 3–12. Springer, Heidelberg (2006)
Feng, J., Qian, Q., Wang, J., Zhou, L.: Exploit Sequencing to Accelerate Hot XML Query Pattern Mining. In: SAC 2006, April 23–27 (2006)
Chen, L., Bhowmick, S.S., Chia, L.T.: FRACTURE-Mining: Mining Frequently and Concurrently Mutating Structures from Historical XML Documents. Elsevier Science Journal: Data & Knowledge Engineering 59, 320–347 (2006)
Yun, U., Leggett, J.J.: WIP:mining Weighted Interesting Patterns with a strong weight and/or support affinity. In: Proceedings of the Sixth SIAM International Conference on Data Mining, Bethesda, MD, USA, pp. 20–22. SIAM, Philadelphia (2006)
Yun, U., Leggett, J.J.: WFIM: Weighted Frequent Itemset Mining with a weight range and a minimum weight. In: Jonker, W., Petković, M. (eds.) SDM 2005. LNCS, vol. 3674. Springer, Heidelberg (2005)
Yun, U., Leggett, J.J.: WSpan: Weighted Sequential Pattern Mining in Large Sequence Databases. In: Proc. of the Third Int’l Conf. on IEEE Intelligent Systems, pp. 512–517 (September 2006)
Yun, U.: WIS: Weighted interesting sequential pattern mining with a similar level of support and/or weight. ETRI Journal 2007 29, 336–352 (2007)
Hwang, J.H., Ryu, K.H.: A weighted common structure based clustering technique for XML documents. Journal of Systems and Software 2010 83, 1267–1274 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gu, M.S., Hwang, J.H., Ho Ryu, K. (2010). Weigted-FP-Tree Based XML Query Pattern Mining. In: Cao, L., Feng, Y., Zhong, J. (eds) Advanced Data Mining and Applications. ADMA 2010. Lecture Notes in Computer Science(), vol 6440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17316-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-17316-5_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17315-8
Online ISBN: 978-3-642-17316-5
eBook Packages: Computer ScienceComputer Science (R0)