IDEAS home Printed from https://ideas.repec.org/a/ids/ijenma/v10y2019i3-4p272-279.html
   My bibliography  Save this article

P-tree oriented association rule mining of multiple data sources

Author

Listed:
  • R. Subha

Abstract

A prominent research area in data mining field is (ARM). As distributed databases emerged, need to mine different patterns across them become necessary and hence distributed ARM algorithms were desired. But these algorithms increased communication complexity and overhead. This paper proposes a new algorithm P-tree oriented distributed association rule mining (PDAM) for mining association rules from distributed databases. This algorithm enables a quicker computation of support counts of item sets. P-tree, a special kind of data structure is used in the algorithm which holds the transactional data. These tree data structures do effective storage of data by employing lossless compression techniques. Message exchange optimisation is proposed in this paper. Both the database scans as well as message exchanges are reduced by the proposed method. It would also reduce the size of average transactions, data sets and message exchanges.

Suggested Citation

  • R. Subha, 2019. "P-tree oriented association rule mining of multiple data sources," International Journal of Enterprise Network Management, Inderscience Enterprises Ltd, vol. 10(3/4), pages 272-279.
    • Handle: RePEc:ids:ijenma:v:10:y:2019:i:3/4:p:272-279
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=103156
    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:ijenma:v:10:y:2019:i:3/4:p:272-279. 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=187 .

    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.