提取最小无冗余规则的关键是获取频繁封闭项集所对应的同交易项集集合中的最小项集.为了便于利用概念格提取这类规则,本文提出量化规则格,重点讨论在渐进构造格的过程中生成节点所对应的同交易项集中的最小项集的问题,并给出相应的算法.由于量化规则格和格节点对应的具有相同交易集的最小项集是渐进生成的,因此,它适合于从动态数据库中提取最小无冗余的关联规则并且可方便地实现规则的渐增更新.
The key for extracting the minimal non-redundant rule is to obtain the least itemsets in the Set of Frequent Itemsets with the Same Tidset(SFIST) which corresponds to the frequent closed itemset . To extract such rules using the concept lattice conveniently , the Quantitative Rule Lattice(QRL) with new data structure is presented, the way obtaining the set of the least itemsets in the SFIST of the node in QRL is discussed and the relevant algorithm is provided . Due to incremental formation of QRL and the set of the least itemsets, the QRL is very suitable for both extracting the minimal non - redundant rules from the dynamic database and realizing the rule updated incrementally.