【摘要】 在事务数据库中挖掘关联规则已成为数据挖掘领域的一个重要研究课题,而其中频繁项集的查找时间是影响挖掘效率的关键因素。基于Apriori算法,根据最大频繁集的双向查找算法,提出了算法的实现步骤,让两个方向的剪枝工作实现信息共享,加快最大频繁集的查找速度,节省I/O操作时间,并且通过实例和仿真实验验证了算法的高效性。更多还原

【Abstract】 Based on the Apriori algorithm and the Two-Way search algorithm fordiscovering the maximum frequent set, it proposed the realization ideas of the method with it the two- way prune procedures can share the information soitcan increase thediscoveringrate and economize theoperation time of I/O. It also testifiedthe higher efficiency of the algorithm through examples and experiments.更多还原