At last, the problem of frequent subgraph extraction, whose core is the graph isomorphism, is solved.
最后，论文解决了以图同构为核心的频繁子图抽取问题。
参考来源 - 关联规则挖掘的拓展性研究So the approach of graph based link analysis is based on frequent subgraph searching algorithm.
因此频繁子图发现算法,是基于图的链接发现技术的基础。
参考来源 - 基于图的链接发现在反洗钱中的应用研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Frequent subgraph mining includes subgraph search and isomorphism problems.
频繁子图挖掘主要涉及到子图搜索和子图同构问题。
In this paper we introduce a problem of discovering frequent subgraph with flexible time constraints.
中文摘要在本篇论文中我们提出探勘具时间限制的频繁子图问题。
With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.
随着对大量结构化数据分析需求的增长，从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。
应用推荐