IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2020i1p35-d468209.html
   My bibliography  Save this article

Mining High Utility Itemsets Based on Pattern Growth without Candidate Generation

Author

Listed:
  • Yiwei Liu

    (School of Computer Science and Technology, Dalian University of Technology, No.2 Linggong Road, Ganjingzi District, Dalian 116024, China
    School of Innovation and Entrepreneurship, Dalian University of Technology, No.2 Linggong Road, Ganjingzi District, Dalian 116024, China)

  • Le Wang

    (College of Digital Technology and Engineering, Ningbo University of Finance and Economics, 899 Xueyuan Road, Haishu District, Ningbo 315175, China)

  • Lin Feng

    (School of Computer Science and Technology, Dalian University of Technology, No.2 Linggong Road, Ganjingzi District, Dalian 116024, China
    School of Innovation and Entrepreneurship, Dalian University of Technology, No.2 Linggong Road, Ganjingzi District, Dalian 116024, China)

  • Bo Jin

    (School of Computer Science and Technology, Dalian University of Technology, No.2 Linggong Road, Ganjingzi District, Dalian 116024, China
    School of Innovation and Entrepreneurship, Dalian University of Technology, No.2 Linggong Road, Ganjingzi District, Dalian 116024, China)

Abstract

Mining high utility itemsets (HUIs) has been an active research topic in data mining in recent years. Existing HUI mining algorithms typically take two steps: generating candidates and identifying utility values of these candidate itemsets. The performance of these algorithms depends on the efficiency of both steps, both of which are usually time-consuming. In this study, we propose an efficient pattern-growth based HUI mining algorithm, called tail-node tree-based high-utility itemset (TNT-HUI) mining. This algorithm avoids the time-consuming candidate generation step, as well as the need of scanning the original dataset multiple times for exact utility values, as supported by a novel tree structure, named the tail-node tree (TN-Tree). The performance of TNT-HUI was evaluated in comparison with state-of-the-art benchmark methods on different datasets. Experimental results showed that TNT-HUI outperformed benchmark algorithms in both execution time and memory use by orders of magnitude. The performance gap is larger for denser datasets and lower thresholds.

Suggested Citation

  • Yiwei Liu & Le Wang & Lin Feng & Bo Jin, 2020. "Mining High Utility Itemsets Based on Pattern Growth without Candidate Generation," Mathematics, MDPI, vol. 9(1), pages 1-22, December.
  • Handle: RePEc:gam:jmathe:v:9:y:2020:i:1:p:35-:d:468209
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/1/35/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/1/35/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2020:i:1:p:35-:d:468209. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.