1) closed itemset
闭项集
1.
To solve this problem,an algorithm for mining non-redundant association rules based on closed itemset is proposed.
针对关联规则挖掘中存在的规则数量过多,难于理解和应用的问题,提出了一种基于闭项集的无冗余关联规则挖掘算法。
2) Closed itemset lattice
闭项集格
3) closed itemsets
闭合项集
1.
Then based on the improved FP-tree a frequent closed itemsets mining algorithm is provided to improve the effectiveness of mining frequent close itemsets.
在经典的频繁闭合项集挖掘算法中,如Closet与Closet+,当条件模式数据库很庞大时,频繁项集的数目将会急剧增长,算法的效率会逐步恶化,并且算法挖掘结果的有效性也随着大量冗余模式的产生而下降。
4) frequent closed item-set
频繁闭项集
1.
It is found in recent studies that concept lattice can be used to solve the problem of incremental frequent closed item-set mining.
近年的研究表明,概念格可以应用于解决频繁闭项集的挖掘问题。
5) frequent closed itemset
频繁闭项集
1.
Mining frequent closed itemsets in unidirectional FP-tree;
在单向FP-tree上挖掘频繁闭项集
2.
The set of frequent closed itemsets determines exactly the complete set of all frequent itemsets and is usually much smaller than the latter.
频繁闭项集惟一确定频繁项集且规模小得多,但挖掘频繁闭项集仍是很费时的。
3.
Therefore,mining frequent closed itemsets in data streams becomes a new important problem in recent years,where algorithm Moment was regarded as a typical method of them.
因此,近年来人们开始关注在数据流中挖掘频繁闭项集,其中一个典型的工作就是Moment算法。
6) closed items
封闭项目集
1.
Through found the closed items it can be dramatically reduced the number of frequent itemsets.
通过求封闭项目集大大消减了频繁项目集数量,再由封闭项目集构造一种新的存储机制———近似格,基于近似格可以得到冗余度较小的关联规则,从而提供用户简洁紧凑又无信息丢失的关联规则集。
补充资料：闭集
闭集
dosed set
闭集ld吹d肥t买姗.叮l说M“馏ec佃]，拓扑空间中的 含有它的所有极限点〔见集合的极限点(】imjtpolnt of a set)、的集合.于是，闭集的补集的所有点都是内点，所以闭集可定义为开集的补集.闭集的概念是把拓扑空间定义为具有满足下列公理的特定集合系统〔所谓闭集)的作空集X的基础:X本身和空集是闭集;任意个闭集的交是闭集;有限个闭集的并是闭集.
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条