Yuhang Long1, Wensheng Tang1, *, Bo Yang1, *, Xinyu Wang2, Hua Ma1, Hang Shi1, Xueyu Cheng3
CMC-Computers, Materials & Continua, Vol.63, No.3, pp. 1445-1469, 2020, DOI:10.32604/cmc.2020.09944
Abstract Currently, the top-rank-k has been widely applied to mine frequent patterns
with a rank not exceeding k. In the existing algorithms, although a level-wise-search
could fully mine the target patterns, it usually leads to the delay of high rank patterns
generation, resulting in the slow growth of the support threshold and the mining
efficiency. Aiming at this problem, a greedy-strategy-based top-rank-k frequent patterns
hybrid mining algorithm (GTK) is proposed in this paper. In this algorithm, top-rank-k
patterns are stored in a static doubly linked list called RSL, and the patterns are divided
into short patterns and long patterns. The short… More >
Login
Register
