Inverted Index Automata Frequent Itemset Mining for Large Dataset Frequent Itemset Mining
Frequent itemset mining (FIM) faces significant challenges with the expansion of large-scale datasets. Traditional algorithms such as Apriori, FP-Growth, and Eclat suffer from poor scalability and low efficiency when applied to modern datasets characterized by high dimensionality and high-density fe...
Saved in:
| Main Authors: | Xin Dai, Haza Nuzly Abdull Hamed, Qichen Su, Xue Hao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10811914/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Robust Technique for Closed Frequent and High Utility Itemsets Mining: Closed-FHUIM
by: Muhammad Waheed Ashraf, et al.
Published: (2024-01-01) -
An efficient and resilience linear prefix approach for mining maximal frequent itemset using clustering
by: M. Sinthuja, et al.
Published: (2025-03-01) -
DIAFM: An Improved and Novel Approach for Incremental Frequent Itemset Mining
by: Mohsin Shaikh, et al.
Published: (2024-12-01) -
Damped weighted erasable itemset mining with time sensitive dynamic environments
by: Hanju Kim, et al.
Published: (2025-01-01) -
DISCOVERING CONFUSING FREQUENT ITEMSETS
by: Huỳnh Thành Lộc
Published: (2018-07-01)