DSpace Repository

Mining Rare Association Rules in a Distributed Environment using Multiple Minimum Supports

Show simple item record

dc.contributor.advisor Prof. Sumanta Guha (Chairperson)
dc.contributor.author Tempaiboolkul, Jutamas
dc.contributor.other Prof. Phan Minh Dung (Member) Dr. Raphael Duboz (Member)
dc.date.accessioned 2015-02-03T01:54:50Z
dc.date.available 2015-02-03T01:54:50Z
dc.date.issued 2013-05
dc.identifier.other AIT Thesis no.IM-13-05 en_US
dc.identifier.uri http://www.cs.ait.ac.th/xmlui/handle/123456789/722
dc.description.abstract Distributed data mining of association rules is an area of data mining which intends to find association rules over items geographically across the network. Several researches have been performed in this field as applications have started to exploit distributed databases. Discovering rare association rules is a new area of distributed mining research. In this paper, an algorithm for discovering rare association rules in distributed environment is proposed. It utilized the idea of using statistic percentile to produce multiple minimum supports to mine rare association rules. Finally, the proposed algorithm has been implemented and evaluated by comparing with the Optimized Distributed Association rule Mining (ODAM) algorithm and the Apriori with Multiple Support Generating by statistic Percentile threshold (Apriori MSG-P) algorithm. The result shows that the proposed algorithm can discover more rare association rules with an optimized communication cost. en_US
dc.description.sponsorship Thailand (HM King) en_US
dc.publisher AIT en_US
dc.subject Distributed data mining, Association rules, Multiple minimum supports, Rare association rules, Statistic percentile en_US
dc.title Mining Rare Association Rules in a Distributed Environment using Multiple Minimum Supports en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account