基于概念格的关联规则对半查找算法设计

Design of Bisearch Algorithm Association Rules Based on Concept Lattice

提出一种应用二分法查找频繁封闭项目集的算法,将维数区间对半划分,每次遍历时都计算落在前半区的项目集的支持度。该算法能有效减少数据库遍历次数,提高效率。

Designs a bisearch algorithm for searching frequent closed itemset. Itemsets are compartmentalized by dimension. The algorithm plots out the dimension interval half-and-half and the itemsets in the former are computed when passing the database. The passes of database are effectively reduced by the bisearch algorithm.