![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
A New Approach for Frequent Pattern Mining
Subscribe/Renew Journal
In this paper, we review the partition algorithm proposed for mining frequent itemsets and we propose AdvPartition, a new algorithm, which introduces several improvements to the classic Partition algorithm. Our goal was the optimization of the most time consuming phase of Partition algorithm i.e. the Database Scans. In a thorough experimental evaluation of our algorithm on standard benchmark data from the literature, our algorithm outperforms previous work upto an order of magnitude.
Keywords
Apriori, Association Rules, Frequent Patterns, Transactional Database.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 218
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 2