![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 Novel Approach for Reducing the Candidate Item Sets and Large Item Sets by Fuzzy Mining Association Rule
Subscribe/Renew Journal
In this era of modern computing world, there are many fuzzy association algorithms is developed and still lots of work have to performed in this area. Some already proposed algorithm reduces data sets or space complexity and some reduces the time complexity and so on. Our proposed algorithms reduce the space complexity by reducing the candidate item sets and large item sets from data sets. We use the row count technique in fuzzy association rules.
Keywords
Candidate Item Sets, Large Item Sets, Time Complexity.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 350
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0