1) frequent closed itemsets
频繁闭项目集
1.
New algorithm of mining frequent closed itemsets;
一种新的频繁闭项目集挖掘算法(英文)
2.
Discovering frequent closed itemsets is a key problem in data mining application.
在数据挖掘研究中,频繁闭项目集挖掘成为重要的研究方向。
2) φ frequent closed itemset
φ频繁闭项目集
3) frequent closed itemsets
频繁闭合项目集
1.
The set of frequent closed itemsets determines exactly the complete set of all frequent itemsets and is usually much smaller than the laster.
频繁闭合项目集集可惟一确定频繁项目集完全集且数量小得多,然而有关频繁闭合项目集的更新还不多见。
2.
There are many mining algorithms about frequent closed itemsets,such as CLOSET.
目前频繁闭合项目集挖掘算法有很多,例如CLOSET[1]。
4) close frequent itemset
闭合频繁项目集
5) 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.
近年的研究表明,概念格可以应用于解决频繁闭项集的挖掘问题。
6) 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算法。
补充资料：闭集
闭集
dosed set
闭集ld吹d肥t买姗.叮l说M“馏ec佃]，拓扑空间中的 含有它的所有极限点〔见集合的极限点(】imjtpolnt of a set)、的集合.于是，闭集的补集的所有点都是内点，所以闭集可定义为开集的补集.闭集的概念是把拓扑空间定义为具有满足下列公理的特定集合系统〔所谓闭集)的作空集X的基础:X本身和空集是闭集;任意个闭集的交是闭集;有限个闭集的并是闭集.
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条