1) Frequent Subgraph Structure
频繁子图结构
2) frequent substructure
频繁子结构
1.
Review of graph-based frequent substructure mining algorithm
基于图的频繁子结构挖掘算法综述
3) frequent structure
频繁结构
4) frequent subgraph
频繁子图
1.
New efficient width-first algorithm for mining frequent subgraph;
宽度优先的频繁子图高效挖掘新算法
2.
In order to solve the problem,this paper propose a new method called FSM(frequent subgraph mining) to find frequent subgraph and prove corresponding theoritics to guarantee the exactness of FSM.
该文通过引入子图同构和结构同构的概念,借助贪婪搜索算法和完全级别搜索算法的思想,结合图论和频繁项目集的挖掘算法,提出了一种新的频繁子图挖掘算法——FSM(frequent subgraph mining)。
3.
An alternate way to solve these problems is to represent the transactions of those domains by graph,and find the frequent subgraphs by using graph-based data mining techniques.
一种解决的方法就是用图的形式表示这些领域的事务,然后利用基于图论的数据挖掘技术发现频繁子图。
5) frequent subgraphs
频繁子图
1.
Due to the frequent subgraphs mining generate a great results set, this restricts the algorithm performance to some extent, and mining maximal frequent subgraphs can effectively reduce the results set of the frequent subgraphs.
由于频繁子图挖掘会产生巨大的结果集,在一定程度上制约了算法性能,而最大频繁子图挖掘可以有效缩减频繁子图的结果集。
2.
Therefore it is imperative to improve the efficiency of mining the frequent subgraphs.
随着图的广泛应用,图的规模不断扩大,因此提高频繁子图挖掘效率势在必行。
6) frequenct Hamilton subgraph
频繁Hamilton子图
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条