UCSY's Research Repository

Implementing Association Rules Generator using CHARM

Show simple item record

dc.contributor.author Aung, Zay
dc.contributor.author Naing, Thinn
dc.date.accessioned 2019-07-15T08:25:07Z
dc.date.available 2019-07-15T08:25:07Z
dc.date.issued 2010-12-16
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/908
dc.description.abstract In traditional association rule mining that based on Apriori-like algorithm, all frequent itemsets are computed and strong association rules are then generated from the set of all frequent itemsets as a next step. By contrast, in closed association rule mining, instead of mining all frequent itemsets in the first step, only the set of all closed frequent itemsets is mined where the size of the set of all closed frequent itemsets is much smaller than that of all frequent itemsets. Instead of generating rules from the set of all frequent itemsets, rules are generated from the set of all closed frequent itemsets , where the size of rules generated from the set of closed frequent itemsets is much smaller than that generated from the set of all closed frequent itemsets. This paper describes the concept of closed association rule mining, how CHARM algorithm works to find out all closed frequent itemsets, and the implementation of rules generating system or rules generator that mainly uses closed association rule mining techniques by using CHARM Algorithm. en_US
dc.language.iso en en_US
dc.publisher Fifth Local Conference on Parallel and Soft Computing en_US
dc.subject itemsets en_US
dc.subject transaction sets en_US
dc.subject support en_US
dc.subject confidence en_US
dc.subject closed frequent itemsets en_US
dc.subject closure of itemsets en_US
dc.subject closure of transaction sets en_US
dc.title Implementing Association Rules Generator using CHARM en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account