对关联规则挖掘问题建立了完全格描述并给出了问题规模下限，提出了一种基于搜索空间划分的项集频度计算模型。
The problem of mining association rules with lattices is descried and the lower bonds of the problem′s are gained.
对关联规则挖掘问题建立了完全格描述并给出了问题规模下限，提出了一种基于搜索空间划分的项集频度计算模型。
The problem of mining association rules with lattices is descried and the lower bonds of the problem′s are gained.
应用推荐