arrow
返回

Mining significant trend sequences in dynamic attributed graphs

delete2019-10-01
delete17
PRE
AI
P
Philippe Fournier‐Viger *
C
Chao Cheng
C
Cheng Zhi
J
Jerry Chun‐Wei Lin
N
Nazha Selmaoui‐Folcher
DOI:10.1016/j.knosys.2019.06.005delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Discovering patterns in graphs has many applications such as social network, biological and chemistry data analysis. Although many algorithms were proposed to identify interesting patterns in graphs, most of them consider simple types of graphs such as static graphs or graphs having a single attribute per vertex. Recently, studies have considered discovering frequent patterns in dynamic attributed graphs. These graphs can represent not only relationships between entities but also how they evolve over time, and describe entities with multiple attributes. Algorithms for mining frequent patterns in dynamic attributed graphs select patterns based on their occurrence frequency. But a major drawback of this approach is that many frequent patterns may contain entities that are weakly correlated. Thus, numerous frequent but spurious patterns may be shown to the user. To allows discovering strongly correlated patterns in dynamic attributed graphs, this paper proposes a novel significance measure named Sequence Virtual Growth Rate. It allows evaluating if a pattern represents entities that are correlated in terms of their proximity in a graph over time. Based on this measure a novel type of graph patterns is defined called Significant Trend Sequence. To efficiently mine these patterns, two algorithms named TSeqMiner(dfs-bfs), and TSeqMiner(dfs-bfs) are proposed. They rely on a novel upper bound and pruning strategy to reduce the search space. Experimental results show that the proposed algorithms are efficient and can identify interesting patterns in real-world social network and flight data. (C) 2019 Published by Elsevier B.V.
Keyword:
Graph mining
Dynamic attributed graph
Significance measure
Sequence
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.2W
被引数:
4.5W

机构

H
harbin institute of technology
学者数:
8.0W
论文数: 6.6W
被引数: 66
U
universite nouvelle caledonie
学者数:
303
论文数: 209
被引数: 2
W
Western Norway University of Applied Sciences
学者数:
2.2K
论文数: 2.2K
被引数: 1.4K
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Surgical management of pelvic organ prolapse
err2018-12-21
err0
errOAAI
errC. F. Maher; K. K. Baessler; M. D. Barber; C. Cheong; E. C. J. Consten; K. G. Cooper; X. Deffieux; V. Dietz; R. E. Gutman; J. J. van Iersel; C. W. Nager; V. W. Sung; R. de Tayrac
err分享
err收藏
err分享
err收藏
Extracting non-redundant correlated purchase behaviors by utility measure
err2018-03-01
err50
PREAI
errGan, Wensheng; Lin, Jerry Chun-Wei; Fournier-Viger, Philippe; Chao, Han-Chieh; Fujita, Hamido
err分享
err收藏
Cascading Spatio-Temporal Pattern Discovery
err2012-11-01
err64
errOAAI
errMohan, Pradeep; Shekhar, Shashi; Shine, James A.; Rogers, James P.
err分享
err收藏
学者 查看更多内容