...通闭图集挖掘算法 关键词：子图挖掘；频繁模式树；频繁模式增长；频繁闭图集；生物网络 [gap=1051]Key words．subgraph mining；FP——Tree；FP——Growth；closed frequent subgraph set；biological networks ..
基于16个网页-相关网页
频繁子图挖掘 frequent sub-graph mining
In order to resolve the problem of traditional Apriori algorithm that exists redundancy subgraphs when mining frequent subgraph, a new frequent subgraph mining algorithm called GAI is proposed.
传统Aprior频繁子图挖掘算法中存在大量冗余子图。
参考来源 - 一种新的频繁子图挖掘算法·2,447,543篇论文数据，部分数据来源于NoteExpress
提出了一种基于关联矩阵的频繁子图挖掘算法。
An algorithm for mining frequent subgraphs based on associated matrix was proposed.
频繁子图挖掘主要涉及到子图搜索和子图同构问题。
Frequent subgraph mining includes subgraph search and isomorphism problems.
随着图的广泛应用，图的规模不断扩大，因此提高频繁子图挖掘效率势在必行。
Therefore it is imperative to improve the efficiency of mining the frequent subgraphs.
应用推荐