IDEAS home Printed from https://ideas.repec.org/a/ids/ijdmmm/v8y2016i3p265-278.html
   My bibliography  Save this article

Mining frequent patterns without tree generation

Author

Listed:
  • K.V. Shanthi
  • J. Akilandeswari
  • G. Jothi

Abstract

Association rule mining is one of the popular data mining techniques used in varied applications. The technique's biggest challenge is to reduce the time taken in finding the frequent patterns. Though there are various works available in literature on pattern mining, improving efficiency and scalability is still an important research issue. This paper presents a methodology using numerical approach to analyse large datasets and minimise the amount of data examined for generating candidate sets. The proposed algorithm uniquely encodes the data and the entire encoded database can be stored in main memory. This leads to the reduction in both space and time complexity. The frequent patterns are generated without any candidate set or tree construction. The performance of the algorithm is better with respect to both time and space compared to FP-growth and PFM algorithms.

Suggested Citation

  • K.V. Shanthi & J. Akilandeswari & G. Jothi, 2016. "Mining frequent patterns without tree generation," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 8(3), pages 265-278.
    • Handle: RePEc:ids:ijdmmm:v:8:y:2016:i:3:p:265-278
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=79062
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijdmmm:v:8:y:2016:i:3:p:265-278. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=342 .

    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.