2020
DOI: 10.1007/978-3-030-59065-9_14
|View full text |Cite
|
Sign up to set email alerts
|

Mining Attribute Evolution Rules in Dynamic Attributed Graphs

Abstract: A dynamic attributed graph is a graph that changes over time and where each vertex is described using multiple continuous attributes. Such graphs are found in numerous domains, e.g., social network analysis. Several studies have been done on discovering patterns in dynamic attributed graphs to reveal how attribute(s) change over time. However, many algorithms restrict all attribute values in a pattern to follow the same trend (e.g. increase) and the set of vertices in a pattern to be fixed, while others consid… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…Pasquier et al proposed to mine frequent trees in a forest of attributed trees [14], while Atzmueller et al designed the MinerLSD algorithm to find core subgraphs in an attributed graph [16]. Besides, algorithms were designed to find temporal patterns in dynamic attributed graphs [1], [19]. However, most graph pattern mining approaches have many parameters that users generally set by trial and error, which is time-consuming and prone to errors.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Pasquier et al proposed to mine frequent trees in a forest of attributed trees [14], while Atzmueller et al designed the MinerLSD algorithm to find core subgraphs in an attributed graph [16]. Besides, algorithms were designed to find temporal patterns in dynamic attributed graphs [1], [19]. However, most graph pattern mining approaches have many parameters that users generally set by trial and error, which is time-consuming and prone to errors.…”
Section: Related Workmentioning
confidence: 99%
“…After calculating the gains, pairs with positive gains are added to candidates and the related information is recorded in rdict (line [10][11][12]. Finally, the pairs whose gains are influenced by the merge operation are updated in candidates (line [17][18][19][20][21]. It is a fact that frequencies of a-stars having partly merged leafsets are always reduced by the merge operation.…”
Section: Optimizationmentioning
confidence: 99%
“…the addition and deletion of edges only [27,2] or both nodes and edges [24] over time, is the most studied evolution type. To meet more complex needs, some models include attributes of nodes [6,7] or both edges and nodes' attributes [11] to capture the temporal evolution in their values. In the previous cited works, they generally consider the attribute set of nodes or edges as fixed while it can evolve over time in real-world applications.…”
Section: Related Workmentioning
confidence: 99%
“…There is only one case where it has not yet got a pre-defined ending time: if some instances under the current state s ri u are current in the application and both connected entities' instances i h and i l do not have yet a pre-defined ending time. 7 where T i h is the valid time of an instance i h of e i and T i l is the valid time of an instance i l of e j . (T Example 1.…”
Section: Propositionmentioning
confidence: 99%
“…Existing pattern mining approaches in dynamic attributed graphs allow following sequential evolutions within an individual vertex [8] or a set of vertices [1,5,7] that occur frequently over time. None of these approaches allows finding frequent sequential evolutions for general sets of connected vertices (i.e., frequent subgraphs).…”
Section: Introductionmentioning
confidence: 99%