GraphScope: parameter-free mining of large time-evolving graphs

@inproceedings{Sun2007GraphScopePM,
  title={GraphScope: parameter-free mining of large time-evolving graphs},
  author={Jimeng Sun and Christos Faloutsos and Spiros Papadimitriou and Philip S. Yu},
  booktitle={Knowledge Discovery and Data Mining},
  year={2007}
}
How can we find communities in dynamic networks of socialinteractions, such as who calls whom, who emails whom, or who sells to whom. [] Key Method Moreover, it is designed to operate on large graphs, in a streaming fashion. We demonstrate the efficiency and effectiveness of our GraphScope on real datasets from several diverse domains. In all cases it produces meaningful time-evolving patterns that agree with human intuition.

Proximity Tracking on Time-Evolving Bipartite Graphs

Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time-evolving bipartite

TimeCrunch: Interpretable Dynamic Graph Summarization

TIMECRUNCH is an effective, scalable and parameter-free method for finding coherent, temporal patterns in dynamic graphs and is able to compress these graphs by summarizing important temporal structures and finds patterns that agree with intuition.

On Summarizing Large-Scale Dynamic Graphs

TIMECRUNCH is able to compress these graphs by summarizing important temporal structures and finds patterns that agree with intuition, and is applied to several large, diverse real-world datasets with up to 36 million edges.

SpotLight: Detecting Anomalies in Streaming Graphs

A randomized sketching-based approach called SpotLight is proposed, which guarantees that an anomalous graph is mapped 'far' away from 'normal' instances in the sketch space with high probability for appropriate choice of parameters.

Fast Monitoring Proximity and Centrality on Time-evolving Bipartite Graphs

Large bipartite graphs that evolve and grow over time (e.g. new links arrive, old links die out, or link weights change) arise in many settings, such as social networks, co-citations, market-basket

Online summarization of dynamic graphs using subjective interestingness for sequential data

This work instantiates a novel, generic framework for subjective interestingness for sequential data, and presents DSSG, a heuristic algorithm for the online summarization of dynamic graphs by means of informative actions, each of which represents an interpretable change to the connectivity structure of the graph.

Hierarchical, Parameter-Free Community Discovery

The Context-specific Cluster Tree (CCT) finds communities at multiple levels, with no user intervention, based on information theoretic principles (MDL), and partitions the graph into progressively more refined subgraphs, allowing users to quickly navigate from the global, coarse structure of a graph to more focused and local patterns.

Discovering Burst Areas in Fast Evolving Graphs

This paper studies a new problem of discovering burst areas that exhibit dramatic changes during some periods in evolving graphs by focusing on finding the top-k results in a stream of fast graph evolutions.

Graph mining: laws, generators and tools

The "Kronecker" graph generator is described, which naturally matches all of the known properties of real graphs, and tools for discovering anomalies and patterns in two types of graphs, static and time-evolving are presented.

GraphIn: An Online High Performance Incremental Graph Processing Framework

A dynamic graph analytics framework, GraphIn, that incrementally processes graphs on-the-fly using fixed-sized batches of updates and a novel programming model called I-GAS based on gather-apply-scatter programming paradigm that allows for implementing a large set of incremental graph processing algorithms seamlessly across multiple CPU cores are proposed.
...

References

SHOWING 1-10 OF 20 REFERENCES

AutoPart: Parameter-Free Graph Partitioning and Outlier Detection

This work proposes a novel way to group nodes, using information-theoretic principles to choose both the number of such groups and the mapping from nodes to groups, which is completely parameter-free, and also scales practically linearly with the problem size.

Graphs over time: densification laws, shrinking diameters and possible explanations

A new graph generator is provided, based on a "forest fire" spreading process, that has a simple, intuitive justification, requires very few parameters (like the "flammability" of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.

Online Analysis of Community Evolution in Data Streams

An online analytical processing framework is proposed which separates out online data summarization from offline exploratory querying and is a method which provides the ability to perform exploratory queries without compromising on the quality of the results.

Beyond streams and graphs: dynamic tensor analysis

The dynamic tensor analysis (DTA) method, and its variants are introduced, which provides a compact summary for high-order and high-dimensional data, and it also reveals the hidden correlations.

Fully automatic cross-associations

This work furnishes a clear, information-theoretic criterion to choose a good cross-association as well as its parameters, namely, the number of row and column groups, and provides scalable algorithms to approach the optimal.

Extracting Large-Scale Knowledge Bases from the Web

This paper develops novel algorithms for enumerating and organizing all web occurrences of certain subgraphs that are signatures of web phenomena such as tightly-focused topic communities, webrings, taxonomy trees, keiretsus, etc, and argues that these algorithms run efficiently in this model.

Multilevel k-way Partitioning Scheme for Irregular Graphs

In this paper, we present and study a class of graph partitioning algorithms that reduces the size of the graph by collapsing vertices and edges, we find ak-way partitioning of the smaller graph, and

On power-law relationships of the Internet topology

These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period, and can be used to generate and select realistic topologies for simulation purposes.

Graph-based anomaly detection

This paper introduces two techniques for graph-based anomaly detection, and introduces a new method for calculating the regularity of a graph, with applications to anomaly detection.