【摘要】 目前已提出了许多快速的关联规则挖掘算法,实际上用户只关心部分关联规则,如他们仅想知道包含指定项目的规则.当这些约束被用于数据预处理或将它结合到数据挖掘算法中去时,可以显著减少算法的执行时间.为此,考虑了一类包含或不包含某些项目的布尔表达式约束条件,提出了一种快速的基于FPtree的约束最大频繁项目集挖掘算法CMFIMA,并对其更新问题进行了研究,提出了一种增量式更新约束最大频繁项目集挖掘算法CMFIUA.更多还原

【Abstract】 The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed In practice, users are often interested in a subset of association rules For example, they may only want rules that contain some specific items Applying such constraints as a pre-processing stepor integrating them into the mining algorithm can dramatically reduce the execution time The problem of integrating constraints, that are Boolean expressions over the presence or absence of items, into the maximum frequent itemsets discovery algorithm is considered An integrated algorithm and its updating algorithm for mining maximum frequent itemsets with item constraints are presented and their tradeoff is discussed which is based on a novel frequent pattern tree (FP-tree) structure that is an extended prefix-tree structure for storing compressed and crucial information about frequent patterns更多还原