Fp-growth algorithm is one of the currently fastest and most popular one for mining association rule without candidate generation. However, it has disadvantages such as complicated data structure and lower space utilization rate. This paper develops the algorithm FP-DMax for mining maximal frequent patterns of dense datasets based on the data structure FP-tree. The algorithm only scans the database twice and generates no candidate itemsets. The experiment shows that ...
