10.1184/R1/6720629.v1
U Kang
Mining Tera-Scale Graphs: Theory, Engineering and Discoveries
2012
Carnegie Mellon University
graph mining
MAPREDUCE
HADOOP
graph structure analysis
radius plot
diameter
connected component
inference
spectral graph analysis
eigensolver
tensor analysis
graph management
graph indexing
graph compression
2012-05-01 00:00:00
article
https://kilthub.cmu.edu/articles/thesis/Mining_Tera-Scale_Graphs_Theory_Engineering_and_Discoveries/6720629
<p>How do we find patterns and anomalies, on graphs with billions of nodes and edges, which do not fit in memory? How to use parallelism for such Tera- or Peta-scale graphs? In this thesis, we propose PEGASUS, a large scale graph mining system implemented on the top of the HADOOP platform, the open source version of MAPREDUCE. PEGASUS includes algorithms which help us spot patterns and anomalous behaviors in large graphs.</p>
<p>PEGASUS enables the structure analysis on large graphs. We unify many different structure analysis algorithms, including the analysis on connected components, PageRank, and radius/diameter, into a general primitive called GIM-V. GIM-V is highly optimized, achieving good scale-up on the number of edges and available machines. We discover surprising patterns using GIM-V, including the 7-degrees of separation in one of the largest publicly available Web graphs, with 7 billion edges.</p>
<p>PEGASUS also enables the inference and the spectral analysis on large graphs. We design an efficient distributed belief propagation algorithm which infer the states of unlabeled nodes given a set of labeled nodes. We also develop an eigensolver for computing top k eigenvalues and eigenvectors of the adjacency matrices of very large graphs. We use the eigensolver to discover anomalous adult advertisers in the who-follows-whom Twitter graph with 3 billion edges. In addition, we develop an efficient tensor decomposition algorithm and use it to analyze a large knowledge base tensor.</p>
<p>Finally, PEGASUS allows the management of large graphs. We propose efficient graph storage and indexing methods to answer graph mining queries quickly. We also develop an edge layout algorithm for better compressing graphs.</p>