An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Introduction to algorithms
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Connectivity in evolving graph with geometric properties
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Reversible sketches for efficient and accurate change detection over network data streams
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Beyond streams and graphs: dynamic tensor analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Pattern Mining in Frequent Dynamic Subgraphs
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
A Graph-Theoretic Approach to Enterprise Network Dynamics (Progress in Computer Science and Applied Logic (PCS))
Discovering and Summarising Regions of Correlated Spatio-Temporal Change in Evolving Graphs
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
GraphScope: parameter-free mining of large time-evolving graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for community identification in dynamic social networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Colibri: fast mining of large static and dynamic graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Spotting Significant Changing Subgraphs in Evolving Graphs
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
A Fast Method to Mine Frequent Subsequences from Graph Sequence Data
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Mining Periodic Behavior in Dynamic Social Networks
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Constant-factor approximation algorithms for identifying dynamic communities
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph Distances in the Data-Stream Model
SIAM Journal on Computing
Constraint-Based Pattern Mining in Dynamic Graphs
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Leadership discovery when data correlatively evolve
World Wide Web
Mining frequent closed trees in evolving data streams
Intelligent Data Analysis - Ubiquitous Knowledge Discovery
Outlier detection in graph streams
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Finding email correspondents in online social networks
World Wide Web
Creation and growth of online social network
World Wide Web
| Hi-index | 0.00 |
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.