1) frequent sequence graph
频繁序列图
2) frequent sequence
频繁序列
1.
IDSG:a new algorithm for mining frequent sequences;
IDSG:一种新的频繁序列挖掘算法
2.
An efficient algorithm for current frequent sequence mining in data stream;
数据流中一种有效的当前频繁序列挖掘方法
3.
Data mining based on XML documents frequent sequence;
XML文档频繁序列的挖掘
4) Frequent sequence aggregate
频繁序列集
5) frequent subsequence
频繁子序列
1.
This paper proposes a new algorithm for mining frequent subsequence in time series based on symbolic representation.
提出一种新的基于符号化表示的时间序列频繁子序列的挖掘算法。
6) frequent closed sequence
频繁闭序列
1.
The set of frequent closed sequence mining has caught researchers′ attention in recent years because it not only determines exactly the set of all frequent sequences but also is much smaller than the set of frequent sequences.
由于频繁闭序列在数量上要远小于频繁序列且与频繁序列有着相同的表达能力在近几年倍受关注。
2.
After that, frequent closed sequences were mined to construct scenarios.
提出一种自动构建入侵场景的方法,将原始报警按照(源,目标)IP对和优先级分类成不同超报警序列集合,从中挖掘频繁闭序列作为入侵场景。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条