Home > Papers

 
 
Mining Top-k Approximate Frequent Patterns
zengyou he * #
Harbin Institute of Technology
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:18 March 2005
Accepted by: none
Citation: zengyou he.Mining Top-k Approximate Frequent Patterns[OL]. [18 March 2005] http://en.paper.edu.cn/en_releasepaper/content/1725
 
 
requent pattern (itemset) mining in transactional databases is one of the most well-studied problems in data mining. One obstacle that limits the practical usage of frequent pattern mining is the extremely large number of patterns generated. Such a large size of the output collection makes it difficult for users to understand and use in practice. Even restricting the output to the border of the frequent itemset collection does not help much in alleviating the problem. In this paper we address the issue of overwhelmingly large output size by introducing and studying the following problem: mining top-k approximate frequent patterns. The union of the power sets of these k sets should satisfy the following conditions: (1) including itemsets with larger support as many as possible and (2) including itemsets with smaller support as few as possible. An integrated objective function is designed to combine these two objectives. Consequently, we derive the upper bounds on objective function an
Keywords:Data Mining, Association Rules, Frequent Pattern, Optimization
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 567
Bookmarked 0
Recommend 5
Comments Array
Submit your papers