基于图数据挖掘算法的犯罪规律研究及应用 关键词：数据挖掘；频繁子图；犯罪规律；核心成员；关联知识 [gap=1105]Key words：data Irlining；frequent subgraph；crime rule；key members；association knowledge
基于60个网页-相关网页
At last, the problem of frequent subgraph extraction, whose core is the graph isomorphism, is solved.
最后，论文解决了以图同构为核心的频繁子图抽取问题。
参考来源 - 关联规则挖掘的拓展性研究Theindex features are organized as depth first search tree which forms during frequent sub-graph query.
本文针对图包含查询中存在的问题,提出利用频繁子图查询过程中形成的深度优先树组织索引,能增量地进行查询图与索引模式之间的子图同构计算。
参考来源 - 图数据查询技术的研究So the approach of graph based link analysis is based on frequent subgraph searching algorithm.
因此频繁子图发现算法,是基于图的链接发现技术的基础。
参考来源 - 基于图的链接发现在反洗钱中的应用研究·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.
中文摘要在本篇论文中我们提出探勘具时间限制的频繁子图问题。
In this paper we introduce a problem of discovering frequent subgraph with flexible time constraints.
应用推荐