【摘要】 为了有效解决关联规则挖掘中最关键的一步即频繁集的产生 ,构造了一个新的频繁树结构 ,以存储数据库中频繁项的信息 ,且基于该频繁树给出挖掘频繁集的算法 .该方法能够避免重复扫描数据库 ,避免产生大量的候选集 ,大大地减少搜索空间更多还原

【Abstract】 In order to solve the most important step in associat io n rules mining,a new frequent tree structure for storing the crucial information of frequent items in database was proposed,and a new algorithm of mining freque nt itemsets was presented based on the frequent tree.By this method,repeated sca ns of database and yields of large amount of candidate itemsets could be avoided .The search space was also reduced greatly.更多还原