Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access

    ARTICLE

    An algorithm for Fast Mining Top-rank-k Frequent Patterns Based on Node-list Data Structure

    Qian Wanga,b,c, Jiadong Rena,b, Darryl N Davisc, Yongqiang Chengc

    Intelligent Automation & Soft Computing, Vol.24, No.2, pp. 399-404, 2018, DOI:10.1080/10798587.2017.1340135

    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 postorder transversal orders for candidate pattern generation and top-rank-k frequent pattern mining. FP_ TopK uses the minimal More >

Displaying 1-10 on page 1 of 1. Per Page