IDEAS home Printed from https://ideas.repec.org/a/gam/jdataj/v3y2018i3p32-d167436.html
   My bibliography  Save this article

Synthesizing High-Utility Patterns from Different Data Sources

Author

Listed:
  • Abhinav Muley

    (Department of Computer Engineering, St. Vincent Pallotti College of Engineering & Technology, Nagpur 441108, India)

  • Manish Gudadhe

    (Department of Computer Engineering, St. Vincent Pallotti College of Engineering & Technology, Nagpur 441108, India)

Abstract

In large organizations, it is often required to collect data from the different geographic branches spread over different locations. Extensive amounts of data may be gathered at the centralized location in order to generate interesting patterns via mono-mining the amassed database. However, it is feasible to mine the useful patterns at the data source itself and forward only these patterns to the centralized company, rather than the entire original database. These patterns also exist in huge numbers, and different sources calculate different utility values for each pattern. This paper proposes a weighted model for aggregating the high-utility patterns from different data sources. The procedure of pattern selection was also proposed to efficiently extract high-utility patterns in our weighted model by discarding low-utility patterns. Meanwhile, the synthesizing model yielded high-utility patterns, unlike association rule mining, in which frequent itemsets are generated by considering each item with equal utility, which is not true in real life applications such as sales transactions. Extensive experiments performed on the datasets with varied characteristics show that the proposed algorithm will be effective for mining very sparse and sparse databases with a huge number of transactions. Our proposed model also outperforms various state-of-the-art distributed models of mining in terms of running time.

Suggested Citation

  • Abhinav Muley & Manish Gudadhe, 2018. "Synthesizing High-Utility Patterns from Different Data Sources," Data, MDPI, vol. 3(3), pages 1-16, September.
  • Handle: RePEc:gam:jdataj:v:3:y:2018:i:3:p:32-:d:167436
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2306-5729/3/3/32/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2306-5729/3/3/32/
    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:jdataj:v:3:y:2018:i:3:p:32-:d:167436. 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.