Advertisement
Published in:
2005 | OriginalPaper | Chapter
Multidimensional Frequent Pattern Mining Using Association Rule Based Constraints
Authors : S. Vijayalakshmi, S. Suresh Raja
Published in: Distributed Computing and Internet Technology
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Knowledge about multi-dimensional frequent patterns is interesting and useful. The classic frequent pattern mining algorithms based on a uniform minimum support, such as Apriori and FP-growth, either miss interesting patterns of low support or suffer from the bottleneck of itemset generation. Other frequent pattern mining algorithms, such as Adaptive Apriori, though taking various supports, focus mining at a single abstraction level. Furthermore, as an Apriori-based algorithm, the efficiency of Adaptive Apriori suffers from the multiple database scans. In this paper, we extend FP-growth to attack the problem of multidimensional frequent pattern mining. The algorithm Ada-FP, which stands for Adaptive FP-growth. The efficiency of the Ada-FP is guaranteed by the high scalability of FP-growth. To increase the effectiveness, the Ada-FP pushes various support constraints into the mining process. We show that the Ada-FP is more flexible at capturing desired knowledge than previous Algorithm.