@article { , title = {An algorithm for fast mining top-rank-k frequent patterns based on node-list data structure}, abstract = {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.}, doi = {10.1080/10798587.2017.1340135}, eissn = {2326-005X}, issn = {1079-8587}, issue = {2}, journal = {Intelligent automation \& soft computing}, pages = {399-404}, publicationstatus = {Published}, publisher = {Taylor and Francis}, url = {https://hull-repository.worktribe.com/output/453522}, volume = {24}, keyword = {Specialist Research - Other, Data mining, Frequent pattern, Top-rank-k frequent pattern, FTPP-tree, Node-list}, year = {2024}, author = {Wang, Qian and Ren, Jiadong and N Davis, Darryl and Cheng, Yongqiang} }