Title: A frequent pattern mining algorithm based on constraints
Abstract: Most algorithms don't allow users to dynamically change constraints in the process of mining frequent patterns.A new algorithm,constrain-based frequent patterns mining,was developed to provide frequent pattern mining with constraints.First,the algorithm constructs the FP-tree(frequent pattern tree) according to the descending or ascending order of constraints,and in this process the database only needs to be scanned once.Secondly,the conditional tree of each item was established to mine maximal frequent pattern with this term as a prefix,and the maximal frequent patterns were stored.Finally,all frequent patterns with precise support degrees were discovered according to the maximal frequent patterns.The significance of this method is that this algorithm allows users to dynamically change constraints during the process.Experimental outcomes showed that the proposed algorithm is more efficient than the algorithm of iCFP.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot