Efficient Mining of Frequent Itemsets Using Only One Dynamic Prefix Tree
Frequent itemset mining is a fundamental problem in data mining area because frequent itemsets have been extensively used in reasoning, classifying, clustering, and so on. To mine frequent itemsets, previous algorithms based on a prefix tree structure have to construct many prefix trees, which is ve...
Main Authors: | Jun-Feng Qu, Bo Hang, Zhao Wu, Zhongbo Wu, Qiong Gu, Bo Tang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9216179/ |
Similar Items
-
Frequent Itemset Hiding Algorithm Using Frequent Pattern Tree Approach
by: Alnatsheh, Rami H.
Published: (2012) -
Incremental Frequent Itemsets Mining With FCFP Tree
by: Jiaojiao Sun, et al.
Published: (2019-01-01) -
TKFIM: Top-K frequent itemset mining technique based on equivalence classes
by: Saood Iqbal, et al.
Published: (2021-03-01) -
A Fast Approach for Up-Scaling Frequent Itemsets
by: Runzi Chen, et al.
Published: (2020-01-01) -
The MapReduce Model on Cascading Platform for Frequent Itemset Mining
by: Nur Rokhman, et al.
Published: (2018-07-01)