Fast Mining Maximum Frequent Itemsets

Concepedia

Publication | Closed Access

Citations

References

2001

Year

Song Lu

Unknown Venue

Knowledge Discovery In DatabasesEngineeringFrequent Pattern MiningInformation RetrievalData MiningData ScienceAssociation RuleUnique Ordering MethodPattern DiscoveryKnowledge DiscoveryPattern MiningStructure MiningComputer ScienceMaximum Frequent ItemsetsMining MethodsCandidate ItemsetsBig Data

Abstract

Discovering maximum frequent itemsets is a key problem in many data mining applications. In this paper, the DMFI (discovery maximum frequent itemsets) algorithm which combines the bottom up and top down searches is proposed to solve this problem. Using the unique ordering method and efficient pruning strategy, the number of candidate itemsets is greatly decreased, therefore CPU time is reduced remarkably.