Mining maximal frequent itemsets in uncertain data

被引：0

作者：

Tang, Xianghong ^{[1
]}

Yang, Quanwei ^{[1
]}

Zheng, Yang ^{[1
]}

机构：

[1] Key Laboratory of Advanced Manufacturing Technology of Ministry of Education, Guizhou University, Guiyang

来源：

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) | 2015年 / 43卷 / 09期

关键词：

Data mining; Frequent itemsets; Frequent pattern tree; Genetic algorithm; Maximal frequent itemsets; Uncertain data;

D O I：

10.13245/j.hust.150906

中图分类号：

学科分类号：

摘要：

Since efficiency and accuracy of mining frequent patterns was not high in uncertain data, an improved UFPGA (uncertain frequent pattern genetic algorithm) was proposed for mining frequent itemsets of the probability. According to features of uncertain data, FP-tree (frequent pattern tree) was improved to mine frequent itemsets and the genetic algorithm with variability of space reduced and breeding operator increased was employed to search for the largest frequent itemsets. UFPGA algorithm shrank the search scope to improve the efficiency of mining frequent itemsets. Results of experiments show that UFPGA algorithm has a good advantage of the time complexity with a positive significance for large-scale uncertain data mining. ©, 2015, Huazhong University of Science and Technology. All right reserved.

引用

页码：29 / 34

页数：5

共 8 条

[1] Agrawal R., Imielinski T., Swami A., Mining association rules between sets of items in large databases, Proceedings of the Acm Sigmod International Conference on Management of Data, pp. 207-216, (1993)
[2] Chui C.K., Kao B., Hung E., Mining frequent itemsets from uncertain data, Proc of the 11th Pacific-Asia Conference on Knowledge Diacovery and Data Mining, pp. 47-58, (2007)
[3] Chui C.K., Kao B., A detrimental approach for mining frequent itemsets from uncertain data, Proc of the 12th Pacific-Asia Conference on Knowledge Diacovery and Data Mining, pp. 64-75, (2008)
[4] Han J., Pei J., Yin Y., Mining frequent patterns without candidate generation, Proc of ACM SIGMOD International Conference on Management of Data, 29, 2, pp. 1-12, (2000)
[5] Leung C.K.S., Mateo M.A.F., Brajczuk D.A.A., Tree-based approach for frequent pattern mining from uncertain data, Proc of the 12th Pacific-Asia Conference on Knowledge Diacovery and Data Mining, pp. 653-661, (2008)
[6] Aggarwal C.C., Li Y., Wang J., Et al., Frequent pattern mining with uncertain data, Proc of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 29-38, (2009)
[7] Leung C.K.S., Sun L., Equivalence class transformation based mining of frequent itemsets from uncertain data, Proceedings of the 201 ACM Symposium on Applied Computing, pp. 983-984, (2011)
[8] Leung C.K.S., Tanbeer S.K., Fast tree-based mining of frequent itemsets from uncertain data, The 17th International Conference on Database Systems for Advanced Applications, pp. 272-287, (2012)

← 1 →