论文部分内容阅读
为便于规则的提取,提出了具有新的节点结构的量化封闭项集格.最小无冗余近似规则具有最小前件和最大后件,并且没有任何信息丢失;还提出了一个新的算法,可以从量化封闭项集格中直接提取最小无冗余近似规则.
In order to facilitate the extraction of rules, a set of quantized closed itemsets with a new node structure is proposed. The minimum non-redundant approximation has the smallest pre-cursor and the largest post-cursor without any information loss. A new algorithm Extracting the smallest and least redundant approximation rules directly from the set of quantified closed items.