.png){kind=icon}
返回
Discovering frequent graph patterns using disjoint paths
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2006.173.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Whereas data mining in structured data focuses on frequent data values, in semistructured and graph data mining, the issue is frequent labels and common specific topologies. Here, the structure of the data is just as important as its content. We study the problem of discovering typical patterns of graph data, a task made difficult because of the complexity of required subtasks, especially subgraph isomorphism. In this paper, we propose a new Apriori-based algorithm for mining graph data, where the basic building blocks are relatively large, disjoint paths. The algorithm is proven to be sound and complete. Empirical evidence shows practical advantages of our approach for certain categories of graphs.
Keyword:
database applications
data mining
mining methods and algorithms
Web mining
graph mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
暂无机构信息
引用论文
A Statistical Physics Perspective to Understand Social Visual Attention in Autism Spectrum Disorder.png)
Perception
PerceptionIF0
PREAI
分享收藏
查看更多内容