An Efficient Approach for Interactive Mining of Frequent Itemsets

Advances in Web-Age Information Management - Lecture Notes in Computer Science ◽

10.1007/11563952_13 ◽

2005 ◽

pp. 138-149 ◽

Cited By ~ 1

Author(s):

Zhi-Hong Deng ◽

Xin Li ◽

Shi-Wei Tang

Keyword(s):

Frequent Itemsets ◽

Efficient Approach ◽

Interactive Mining

Download Full-text

An Efficient Approach of Extracting Frequent Itemsets from Large Data Using HDFS Framework

International Journal on Communications Antenna and Propagation (IRECAP) ◽

10.15866/irecap.v7i6.13354 ◽

2017 ◽

Vol 7 (6) ◽

pp. 529

Author(s):

Prajakta G. Kulkarni ◽

S. R. Khonde

Keyword(s):

Large Data ◽

Frequent Itemsets ◽

Efficient Approach

Download Full-text

An Efficient Approach for Incremental Mining Fuzzy Frequent Itemsets with FP-Tree

International Journal of Uncertainty Fuzziness and Knowledge-Based Systems ◽

10.1142/s0218488516500185 ◽

2016 ◽

Vol 24 (03) ◽

pp. 367-386 ◽

Cited By ~ 8

Author(s):

Weigang Huo ◽

Xingjie Feng ◽

Zhiyuan Zhang

Keyword(s):

Execution Time ◽

Frequent Itemsets ◽

Incremental Mining ◽

Minimum Support ◽

Efficient Approach ◽

Support Threshold ◽

Dynamic Databases ◽

Norm Operator ◽

Memory Cost

Keeping the generated fuzzy frequent itemsets up-to-date and discovering the new fuzzy frequent itemsets are challenging problems in dynamic databases. In this paper, the classical H-struct structure is extended to mining fuzzy frequent itemsets. The extended H-mine algorithm can use any t-norm operator to calculate the support of fuzzy itemset. The FP-tree-based structure called the Initial-FP-tree and the New-FP-tree are built to maintain the fuzzy frequent itemsets in the original database and the new inserted transactions respectively. The strategy of incremental mining of fuzzy frequent itemsets is achieved by breath-first-traversing the Initial-FP-tree and the New-FP-tree. All of the fuzzy frequent itemsets in the updated database can be obtained by traversing the Initial-FP-tree. The experiments on real datasets show that the proposed approach runs faster than the batch extended H-mine algorithm. Comparing with the existing algorithm for incremental mining fuzzy frequent itemsets, the proposed approach is superior in terms of the execution time. The memory cost of the proposed approach is lower than that of the existing algorithm when the minimum support threshold is low.

Download Full-text