Browse > Article
http://dx.doi.org/10.7472/jksii.2013.14.63

Performance evaluation of approximate frequent pattern mining based on probabilistic technique  

Pyun, Gwangbum (Dept. of Computer Science and Research Institute for Computer and Information Communication, Chungbuk National University)
Yun, Unil (Dept. of Computer Science and Research Institute for Computer and Information Communication, Chungbuk National University)
Publication Information
Journal of Internet Computing and Services / v.14, no.1, 2013 , pp. 63-69 More about this Journal
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 study the characteristics of an approximate mining algorithm based on probabilistic technique and run performance evaluation of the efficient approximate frequent pattern mining algorithm. Finally, we analyze the test results for more improvement.
Keywords
approximate frequent pattern mining; Chernoff technique; probabilistic technique; Performance evaluation; scalability;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Agrawal and R. Srikant, "Fast Algorithms of Mining Association Rules", International conference on Very Large Data Bases(VLDB), vol. 20, pp.487-499, 1994.
2 T. Calders, C. Garboni, B. Goethals, Approximation of Frequentness Probability of Itemsets in Uncertain Data. International Conference on Data Mining (ICDM), pp. 749-754, 2010.
3 C. Chen, X. Yan, F. Zhu and J. Han, gApprox: Mining Frequent Approximate Patterns from a Massive Network. ICDM, pp.445-450, 2007.
4 J. Han, J. Pei, Y. Yin and R. Mao, "Mining frequent patterns without candidate generation : a frequent pattern tree approach", Data Mining and Knowledge Discovery, vol 8, pp.53-87. 2004.   DOI   ScienceOn
5 J. Han, H. Cheng, D. Xin and X.Yan, Frequent pattern mining : current status and future directions, Data Mining and Knowledge Discovery(DMKD), vol.15, no.1, pp. 55-86, Aug 2007.   DOI   ScienceOn
6 C.W. Li, K.F. Jea, An adaptive approximation method to discover frequent itemsets over slidingwindow- based data streams, Expert System with Applications(ESWA) 38(10), pp.13386-13404, 2011.   DOI   ScienceOn
7 M. Ren, L. Guo, Mining Recent Approximate Frequent Items in Wireless Sensor Networks, Fuzzy Systems and Knowledge Discovery, pp. 463-467, 2009.
8 P. Wong, T. Chan, M. H. Wong and K. Leung, Predicting Approximate Protein-DNA Binding Cores Using Association Rule Mining, ICDE pp.965-976, 2012.
9 R.C. Wong and A.W. Fu, "Mining top-K frequent itemsets from data streams", Data Mining Knowledge Discovery. Vol.13, pp.193-217, 2006.   DOI
10 J.X. Yu, Z. Chong, H. Lu and A. Zhou, False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams, International conference on Very Large Data Bases(VLDB) vol. 30, pp.204-215, Aug. 2004.
11 U. Yun and K. Ryu, Approximate Weight frequent pattern mining with/without noisy environments, Knowledge-Based System, vol. 24, no. 1, pp. 73-82, Feb 2011.   DOI   ScienceOn
12 Y. Zhao, C. Zhang and S. Zhang, Efficient Frequent Itemsets Mining by Sampling, Advances in Intelligent IT: Active Media Technology, pp.112- 117, 2006.
13 F. Zhu, X. Yan, J. Han and P.S. Yu, Efficient Discovery of frequent Approximate Sequential Patterns, International Conference on DataMining (ICDM), pp.751-756, Dec 2007.
14 Frequent itemset Mining dataset repository. Availble at (http://fimi.cs.helsinki.fi/data/)