2009
DOI: 10.3233/ida-2009-0392
|View full text |Cite
|
Sign up to set email alerts
|

Using graph partitioning to discover regions of correlated spatio-temporal change in evolving graphs

Abstract: There is growing interest in studying dynamic graphs, or graphs that evolve with time. In this work, we investigate a new type of dynamic graph analysis -finding regions of a graph that are evolving in a similar manner and are topologically similar over a period of time. For example, these regions can be used to group a set of changes having a common cause in event detection and fault diagnosis. Prior work [6] has proposed a greedy framework called cSTAG to find these regions. It was accurate in datasets where… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…Leveraging knowledge bases to extract entities has been explored in Michelson and Macskassy (2010). Link analysis algorithms often rely on graphs as a modeling abstraction, such as the evolution of entities in space and time (Mondo et al (2013), Chan et al (2009)) and the identification of patterns (George et al (2009), Chan et al (2008)). The spatio-temporal aspects observe how entities propagate.…”
Section: Storytellingmentioning
confidence: 99%
“…Leveraging knowledge bases to extract entities has been explored in Michelson and Macskassy (2010). Link analysis algorithms often rely on graphs as a modeling abstraction, such as the evolution of entities in space and time (Mondo et al (2013), Chan et al (2009)) and the identification of patterns (George et al (2009), Chan et al (2008)). The spatio-temporal aspects observe how entities propagate.…”
Section: Storytellingmentioning
confidence: 99%