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

An effective hashtable-based approach for incrementally mining closed frequent itemsets using sliding windows

Author

Listed:
  • M. Jeya Sutha
  • F. Ramesh Dhanaseelan

Abstract

Online mining of closed frequent itemsets over streaming data is one of the important problems in mining data streams. In this paper, we propose a new algorithm called 'CFI-StreamSW' (mining closed frequent itemsets over data streams using sliding window), for mining the set of closed frequent itemsets. An effective hash table based approach is followed where two tables are used; one for storing all the items in the transactions and another for closed frequent itemsets. Thus, it does not store any other intermediate nodes or even frequent nodes. Experiments show that the proposed algorithm runs faster and consume less memory than existing algorithms 'NewMoment' and 'MWFP-SW' for mining closed frequent itemsets over recent data streams.

Suggested Citation

  • M. Jeya Sutha & F. Ramesh Dhanaseelan, 2016. "An effective hashtable-based approach for incrementally mining closed frequent itemsets using sliding windows," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 8(4), pages 382-404.
    • Handle: RePEc:ids:ijdmmm:v:8:y:2016:i:4:p:382-404
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=81252
    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:4:p:382-404. 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.