Journal
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
Volume 17, Issue 3, Pages 351-376Publisher
SPRINGER
DOI: 10.1007/s11280-013-0204-x
Keywords
Detecting graph changes; Evolving graphs
Funding
- National Grand Fundamental Research 973 Program of China [2012CB316200]
- National Natural Science Foundation of China [61173022, 61173023]
- Research Grants Council of the Hong Kong SAR, China [419109, 418512]
Ask authors/readers for more resources
Many applications see huge demands of finding important changing areas in evolving graphs. In this paper, given a series of snapshots of an evolving graph, we model and develop algorithms to capture the most frequently changing component (MFCC). Motivated by the intuition that the MFCC should capture the densest area of changes in an evolving graph, we propose a simple yet effective model. Using only one parameter, users can control tradeoffs between the density of the changes and the size of the detected area. We verify the effectiveness and the efficiency of our approach on real data sets systematically.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available