Autosoft Journal

Online Manuscript Access

An algorithm for fast mining top-rank-k frequent patterns based on Node-list data structure



Frequent pattern mining usually requires much run time and memory usage. In some applications, only the patterns with top frequency rank are needed. Because of the limited pattern numbers, quality of the results is even more important than time and memory consumption. A Frequent Pattern algorithm for mining Top-rank-K patterns, FP_TopK, is proposed. It is based on a Node-list data structure extracted from FTPP-tree. Each node is with one or more triple sets, which contain supports, preorder and post-order transversal orders for candidate pattern generation and top-rank-k frequent pattern mining. FP_TopK uses the minimal support threshold for pruning strategy to guarantee that each pattern in the top-rank-k table is really frequent and this further improves the efficiency. Experiments are conducted to compare FP_TopK with iNTK and BTK on four datasets. The results show that FP_TopK achieves better performance.



Total Pages: 6
Pages: 399-404


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways

Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Volume: 24
Issue: 2
Year: 2018

Cite this document


Awad, Bieshoy, Janaka Ekanayake, and Nick Jenkins. "Intelligent Load Control For Frequency Regulation In Microgrids." Intelligent Automation & Soft Computing 16.2 (2010): 303-318. Crossref. Web.

Chae, Young M et al. "Analysis of Healthcare Quality Indicator Using Data Mining and Decision Support System." Expert Systems with Applications 24.2 (2003): 167-172. Crossref. Web.

Dam, Thu-Lan et al. "An Efficient Algorithm for Mining Top-Rank-k Frequent Patterns." Applied Intelligence 45.1 (2016): 96-111. Crossref. Web.

Deng, Zhi-Hong. "Fast Mining Top-Rank-k Frequent Patterns by Using Node-Lists." Expert Systems with Applications 41.4 (2014): 1763-1768. Crossref. Web.

Deng Z.H. Computer Science

Huynh-Thi-Le, Quyen et al. "An Efficient and Effective Algorithm for Mining Top-Rank-k Frequent Patterns." Expert Systems with Applications 42.1 (2015): 156-164. Crossref. Web.

Jianyong Wang et al. "TFP: An Efficient Algorithm for Mining Top-k Frequent Closed Itemsets." IEEE Transactions on Knowledge and Data Engineering 17.5 (2005): 652-663. Crossref. Web.

Le, Tuong, and Bay Vo. "MEI: An Efficient Algorithm for Mining Erasable Itemsets." Engineering Applications of Artificial Intelligence 27 (2014): 155-166. Crossref. Web.

Lee, Gangin, and Unil Yun. "A New Efficient Approach for Mining Uncertain Frequent Patterns Using Minimum Data Structure Without False Positives." Future Generation Computer Systems 68 (2017): 89-110. Crossref. Web.

Liu, Guimei, Hongjun Lu, and Jeffrey Xu Yu. "CFP-Tree: A Compact Disk-Based Structure for Storing and Querying Frequent Itemsets." Information Systems 32.2 (2007): 295-319. Crossref. Web.

Sadik AT. International Journal of Soft Computing

Vo, Bay, Tzung-Pei Hong, and Bac Le. "A Lattice-Based Approach for Mining Most Generalization Association Rules." Knowledge-Based Systems 45 (2013): 20-30. Crossref. Web.

Vo, Bay et al. "An Effective Approach for Maintenance of Pre-Large-Based Frequent-Itemset Lattice in Incremental Mining." Applied Intelligence 41.3 (2014): 759-775. Crossref. Web.

Vo, Bay et al. "A Novel Approach for Mining Maximal Frequent Patterns." Expert Systems with Applications 73 (2017): 178-186. Crossref. Web.

Wei, Xuyang et al. "Mining Users Interest Navigation Patterns Using Improved Ant Colony Optimization." Intelligent Automation & Soft Computing 21.3 (2015): 445-454. Crossref. Web.


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048