Open Access iconOpen Access



A Fast Algorithm for Mining Top-Rank-k Erasable Closed Patterns

Ham Nguyen1, Tuong Le2,3,*

1 Faculty of Information Technology, HUTECH University,Ho Chi Minh City, Vietnam
2 Informetrics Research Group, Ton Duc Thang University, Ho Chi Minh City, Vietnam
3 Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam

* Corresponding Author: Tuong Le. Email: email

Computers, Materials & Continua 2022, 72(2), 3571-3583.


The task of mining erasable patterns (EPs) is a data mining problem that can help factory managers come up with the best product plans for the future. This problem has been studied by many scientists in recent times, and many approaches for mining EPs have been proposed. Erasable closed patterns (ECPs) are an abbreviated representation of EPs and can be considered condensed representations of EPs without information loss. Current methods of mining ECPs identify huge numbers of such patterns, whereas intelligent systems only need a small number. A ranking process therefore needs to be applied prior to use, which causes a reduction in efficiency. To overcome this limitation, this study presents a robust method for mining top-rank-k ECPs in which the mining and ranking phases are combined into a single step. First, we propose a virtual-threshold-based pruning strategy to improve the mining speed. Based on this strategy and dPidset structure, we then develop a fast algorithm for mining top-rank-k ECPs, which we call TRK-ECP. Finally, we carry out experiments to compare the runtime of our TRK-ECP algorithm with two algorithms modified from dVM and TEPUS (Top-rank-k Erasable Pattern mining Using the Subsume concept), which are state-of-the-art algorithms for mining top-rank-k EPs. The results for the running time confirm that TRK-ECP outperforms the other experimental approaches in terms of mining the top-rank-k ECPs.


Cite This Article

H. Nguyen and T. Le, "A fast algorithm for mining top-rank-k erasable closed patterns," Computers, Materials & Continua, vol. 72, no.2, pp. 3571–3583, 2022.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1336


  • 473


  • 0


Share Link