2024-03-29T07:10:42Z
https://meral.edu.mm/oai
oai:meral.edu.mm:recid/3355
2021-12-13T06:03:33Z
1582963302567:1597824273898
user-ucsy
Improving Association Rules Mining by Hashing Algorithm
Lwin, Nang Khine Zar
Tun, Nay Min
Association rule mining, is one of the mostimportant and well researched techniques of datamining. It is the process of discovering large itemsetsappeared in a sufficient number of transactions.Large itemsets from a huge number of candidatelarge itemsets are dominating factor for the overalldata mining performance. This paper presentsmining association rules among items in a largedatabase of sales transactions. To address thisproblem, it present an effective hash-based algorithmfor the candidate set generation. This system appliesan algorithm DHP (Direct Hashing and Pruning) onapplication cosmetic sales data to generate frequentassociation patterns. Generation of smallercandidate sets enables to effectively trim thetransaction database size at a much earlier stage ofthe iterations, thereby reducing the computationalcost of later iterations significantly. Theexperimental results of our system are also discussedin this paper.
2010-12-16
http://hdl.handle.net/20.500.12678/0000003355
https://meral.edu.mm/records/3355