Abstract
Approximate frequent pattern mining is to find approximate patterns, not exact frequent patterns with tolerable variations for more efficiency. As the size of database increases, much faster mining techniques are needed to deal with huge databases. Moreover, it is more difficult to discover exact results of mining patterns due to inherent noise or data diversity. In these cases, by mining approximate frequent patterns, more efficient mining can be performed in terms of runtime, memory usage and scalability. In this paper, we benchmark efficient algorithms of mining approximate frequent patterns based on statistical and probabilistic methods. We study the characteristics of approximate mining algorithms, and perform performance evaluations of the state of the art approximate mining algorithms. Finally, we analyze the test results for more improvement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Chen C, Yan X, Zhu F, Han J (2007) gApprox: mining frequent approximate patterns from a massive network. ICDM, pp 445–450
Chi R, Wai A (2006) Mining top-K frequent itemsets from data streams. Data Min Knowl Discov 13(2):197–217
Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent pattern tree approach. Data Min Knowl Disc 8:53–87
Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov (DMKD) l.15(1):55–86
Manku G, Motwani R (2002) Approximate frequency counts over data streams. VLDB
Wong RC, Fu AW (2006) Mining top-K frequent itemsets from data streams. Data Min Knowl Discov 13:193–217
Wong P, Chan T, Wong MH, Leung K (2012) Predicting approximate protein-DNA binding cores using association rule mining, ICDE pp 965–976
Yun U, Ryu K (2011) Approximate weight frequent pattern mining with/without noisy environments. Knowl Based Syst 24(1):73–82
Zhao Y, Zhang C, Zhang S (2006) Efficient frequent itemsets mining by sampling, advances in intelligent IT. Active Media Technology, pp 112–117
Zhu F, Yan X, Han J, Yu PS (2007) Efficient discovery of frequent approximate sequential patterns. In: International conference on data mining (ICDM), pp 751–756
Acknowledgments
This research was supported by the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (NRF No. 2012-0003740 and 2012-0000478).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Yun, U., Pyun, G., Kim, SJ. (2013). Performance Evaluation of Approximate Pattern Mining Based on Probabilistic and Statistical Techniques. In: Kim, K., Chung, KY. (eds) IT Convergence and Security 2012. Lecture Notes in Electrical Engineering, vol 215. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5860-5_115
Download citation
DOI: https://doi.org/10.1007/978-94-007-5860-5_115
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5859-9
Online ISBN: 978-94-007-5860-5
eBook Packages: EngineeringEngineering (R0)