UCSY's Research Repository

Proposed Method in Adoptive Frequent Itemset Generation

Show simple item record

dc.contributor.author Yu, Thanda Tin
dc.contributor.author Lynn, Khin Thidar
dc.date.accessioned 2019-07-03T07:11:33Z
dc.date.available 2019-07-03T07:11:33Z
dc.date.issued 2018-02-22
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/273
dc.description.abstract Apriori is an algorithm for frequent item set mining and association rule mining over transactional databases. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as those item sets appear sufficiently often in the database. Frequent item set mining and association rule induction are powerful methods for application in domains such as in the shopping behavior of customers of supermarkets, mail-order companies, online shops etc. Firstly, we check if the items are greater than or equal to the minimum support and find the frequent itemsets respectively. Then, the minimum confidence is used to form association rule. This paper proposed the new algorithm based on Apriori algorithm. In this new algorithm, it can reduce the computational complexity than Apriori algorithm. So, the processing time is faster. And it can be used in any dataset which is executable with Apriori algorithm. en_US
dc.language.iso en en_US
dc.publisher Sixteenth International Conferences on Computer Applications(ICCA 2018) en_US
dc.subject Data Mining en_US
dc.subject Apriori algorithm en_US
dc.subject Frequent Pattern mining en_US
dc.subject Adaptvie Apriori algorithm en_US
dc.title Proposed Method in Adoptive Frequent Itemset Generation 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


My Account