IDEAS home Printed from https://ideas.repec.org/a/ids/ijdsci/v4y2019i3p237-259.html
   My bibliography  Save this article

Maximal and closed frequent itemsets mining from uncertain database and data stream

Author

Listed:
  • Maliha Momtaz
  • Abu Ahmed Ferdaus
  • Chowdhury Farhan Ahmed
  • Mohammad Samiullah

Abstract

Frequent itemsets (FIs) mining from uncertain database is a very popular research area nowadays. Many algorithms have been proposed to mine FI from uncertain database. But in typical FI mining process, all the FIs have to be mined individually, which needs a huge memory. Four trees are proposed in this paper which are: (i) maximal frequent itemset from uncertain database (MFU) tree which contains only the maximal frequent itemsets generated from uncertain database, (ii) closed frequent itemset from uncertain database (CFU) tree which contains only closed frequent itemsets generated from uncertain database, (iii) maximal frequent itemset from uncertain data stream (MFUS) tree which contains maximal frequent itemsets generated from uncertain data stream and (iv) closed frequent itemset from uncertain data stream (CFUS) tree which contains closed frequent itemsets generated from uncertain data stream. Experimental results are also presented which show that maximal and closed frequent itemsets mining requires less time and memory than typical frequent itemsets mining.

Suggested Citation

  • Maliha Momtaz & Abu Ahmed Ferdaus & Chowdhury Farhan Ahmed & Mohammad Samiullah, 2019. "Maximal and closed frequent itemsets mining from uncertain database and data stream," International Journal of Data Science, Inderscience Enterprises Ltd, vol. 4(3), pages 237-259.
    • Handle: RePEc:ids:ijdsci:v:4:y:2019:i:3:p:237-259
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=102792
    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:ijdsci:v:4:y:2019:i:3:p:237-259. 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=429 .

    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.