1) minimum frequent closed itemsets
最小频繁闭项目集
2) minimum strong frequent closed itemsets
最小强频繁闭项目集
3) maximal frequent closed itemsets
最大频繁闭项目集
1.
A new algorithm based on an FC-tree (frequent closed pattern tree) and a max-FCIA (maximal frequent closed itemsets algorithm) is presented, which is used to mine the frequent closed itemsets for solving memory and time consuming problems.
为了解决频繁闭项目集挖掘中时间和存储开销大的问题,提出了一种基于FC-tree(频繁闭模式树)的频繁闭项目集挖掘算法max-FCIA(最大频繁闭项目集挖掘算法)。
4) Minimum infrequent itemsets
最小非高频繁项目集
5) φ frequent closed itemset
φ频繁闭项目集
6) frequent closed itemsets
频繁闭项目集
1.
New algorithm of mining frequent closed itemsets;
一种新的频繁闭项目集挖掘算法(英文)
2.
Discovering frequent closed itemsets is a key problem in data mining application.
在数据挖掘研究中,频繁闭项目集挖掘成为重要的研究方向。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条