The week's pick
Reseach Article
A Novel Acceleration Technique to Improve the Speed of Mining Frequent U2 Patterns
| Amrita International Conference of Women in Computing - 2013 |
| Foundation of Computer Science USA |
| AICWIC - Number 4 |
| January 2013 |
| Authors: K. S. Kalaivani, S. Kuppuswami |
| 41ebf8a5-5972-4e1c-9779-58fa26e17f75 |
K. S. Kalaivani, S. Kuppuswami . A Novel Acceleration Technique to Improve the Speed of Mining Frequent U2 Patterns. Amrita International Conference of Women in Computing - 2013. AICWIC, 4 (January 2013), 5-9.
Abstract
Frequent pattern mining is the method of finding patterns like itemsets, subsequences and substructures that repeatedly occur in a dataset. In Univariate Uncertain data, each attribute present in a transaction is represented by a quantitative interval and a probability value. U2P-Miner algorithm is used to mine frequent patterns from U2 data. The number of intervals has a great impact on the time taken for mining frequent patterns. A novel acceleration technique which compares the expected support with the user specified threshold is introduced to minimize the number of intervals thereby improving the speed of the mining process. The runtime of the modified U2P-Miner algorithm is compared with the existing U2P-Miner algorithm.
References
- Agrawal, R. , & Srikant, R. 1994, September. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases, VLDB (Vol. 1215, pp. 487-499).
- Han, J. , Pei, J. , & Yin, Y. 2000, May. Mining frequent patterns without candidate generation. In ACM SIGMOD Record (Vol. 29, No. 2, pp. 1-12). ACM.
- Pei, J. , Han, J. , Lu, H. , Nishio, S. , Tang, S. , & Yang, D. 2001. H-mine: Hyper-structure mining of frequent patterns in large databases. In Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on (pp. 441-448). IEEE.
- Liu, Y. H. 2012. Mining frequent patterns from univariate uncertain data. Data & Knowledge Engineering, 71(1), 47-68.
- Chui, C. K. , Kao, B. , & Hung, E. 2007. Mining frequent itemsets from uncertain data. Advances in Knowledge Discovery and Data Mining, 47-58.
- Leung, C. S. , Carmichael, C. L. , & Hao, B. 2007, October. Efficient mining of frequent patterns from uncertain data. In Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on (pp. 489-494). IEEE.
- Leung, C. K. S. , & Brajczuk, D. A. 2009, June. Efficient algorithms for mining constrained frequent patterns from uncertain data. In Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data (pp. 9-18). ACM.
- Aggarwal, C. C. , Li, Y. , Wang, J. , & Wang, J. 2009, June. Frequent pattern mining with uncertain data. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 29-38). ACM.
- Zimányi, E. , & Pirotte, A. 1996. Imperfect information in relational databases. Uncertainty Management in Information Systems, 35-88.
- Bernecker, T. , Kriegel, H. P. , Renz, M. , Verhein, F. , & Zuefle, A. 2009, June. Probabilistic frequent itemset mining in uncertain databases. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 119-128). ACM.
- Srikant, R. , & Agrawal, R. 1996, June. Mining quantitative association rules in large relational tables. In ACM SIGMOD Record (Vol. 25, No. 2, pp. 1-12). ACM.
- http://taqm. epa. gov. tw/taqm/zh-tw/default. aspx.
Index Terms
Keywords