1) frequent closed itemsets
频繁闭项集
1.
Mining of maximum frequent itemsets and frequent closed itemsets based on frequent itemsets;
基于频繁项集挖掘最大频繁项集和频繁闭项集
2.
Data mining of frequent closed itemsets with Tough constraint;
Tough型约束下的频繁闭项集挖掘
3.
In order to mine fast and efficiently frequent closed itemsets according to insertion, deletion and modification of the database, this paper proposes an incremental maintaining algorithm U_CHARM based on CHARM algorithm.
为了能够随着数据库的增加、删除和修改而快速有效地挖掘出频繁闭项集,根据CHARM算法提出了一种基于频繁闭项集挖掘的增量式维护算法。
2) 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算法。
3) 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.
近年的研究表明,概念格可以应用于解决频繁闭项集的挖掘问题。
4) closed frequent itemset
频繁闭项集
1.
Online mining closed frequent itemsets over a stream sliding window
在线挖掘数据流滑动窗口中频繁闭项集
5) frequent closed itemsets
频繁闭合项集
1.
A new algorithm for mining the frequent closed itemsets based on the H-Struct is put forward.
提出了一种基于H-struct结构的频繁闭合项集挖掘算法H-C。
6) φ frequent closed itemset
φ频繁闭项目集
补充资料：闭集
闭集
dosed set
闭集ld吹d肥t买姗.叮l说M“馏ec佃]，拓扑空间中的 含有它的所有极限点〔见集合的极限点(】imjtpolnt of a set)、的集合.于是，闭集的补集的所有点都是内点，所以闭集可定义为开集的补集.闭集的概念是把拓扑空间定义为具有满足下列公理的特定集合系统〔所谓闭集)的作空集X的基础:X本身和空集是闭集;任意个闭集的交是闭集;有限个闭集的并是闭集.
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条