Hierarchical Adaptive Gap-Run TID Compression for Large-Scale Frequent Itemset Mining

Frequent itemset mining faces the prominent problems of high storage space requirements and low efficiency in a large-scale transaction data environment.The traditional Eclat algorithm usually uses bitmap or sparse array to represent a single transaction identifier (TID), which is difficult to adapt to the changes of dense and sparse transaction data at the same time; Although the existing hybrid representation schemes can partly alleviate this problem, the additional computational overhead caused by frequent data structure switching and the inherent space waste of bitmap structure have not been fundamentally solved. Therefore, this article proposes a HiAGL-FIM algorithm based on Hierarchical Adaptive Gap Run Transaction Identifier List (HAGL-TID). This algorithm adaptively selects Gap List or Run List for transaction identifier encoding through continuity ratio, and designs an efficient TID intersection operation method, completely eliminating dependence on bitmap structure and effectively reducing memory consumption and intersection calculation overhead. The experimental results show that HiAGL-FIM has significant advantages in terms of running time, memory usage, and data scalability compared to classical algorithms such as Eclat, FP Growth, and dEclat. Especially when the transaction data scale reaches millions, it shows a more significant performance improvement, demonstrating the effectiveness and practical value of our method.

@article{Dai2025,
  title     = {Hierarchical Adaptive Gap-Run TID Compression for Large-Scale Frequent Itemset Mining},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {16},
  number    = {9},
  year      = {2025},
  publisher = {The Science and Information Organization},
  author    = {Xin Dai and Chenjiao Liu and Xue Hao and Qichen Su},
  doi       = {10.14569/IJACSA.2025.0160987},
  url       = {https://doi.org/10.14569/IJACSA.2025.0160987}
}