Abstract
In this paper, an algorithm has been proposed for mining frequent itemsets from data cube. Discovering frequent itemsets has been a key process in association rule mining. The major drawbacks of traditional algorithms are that lot of time consumed to find candidate itemsets and lot of memory to store them. Proposed algorithm discovers frequent itemsets using aggregation function and directed graph. It saves lot of memory consumption in candidate generation. It uses aggregation function for dimension reduction and directed graph for candidate itemsets generations. Experimental results show that the proposed algorithm can quickly discover candidate itemsets and effectively mine potential frequent patterns.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
