基于图数据挖掘算法的犯罪规律研究及应用 关键词:数据挖掘;频繁子图;犯罪规律;核心成员;关联知识 [gap=1105]Key words:data Irlining;frequent subgraph;crime rule;key members;association knowledge
基于54个网页-相关网页
frequent subgraph pattern 频繁子图模式
closed frequent subgraph set 频繁闭图集
closed frequent subgraph 闭合频繁子图
frequent subgraph patterns 频繁子图
maximal frequent subgraph 最大频繁子图
Frequent Subgraph Structure 频繁子图结构
frequent subgraph mining algorithm 频繁子图挖掘算法
weighted maximal frequent subgraph 最大加权频繁子图
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.
随着对大量结构化数据分析需求的增长,从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。
应用推荐