HADI: Mining Radii of Large Graphs

HADI: Mining Radii of Large Graphs

Given large, multimillion-node graphs (e.g., Facebook, Web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers? In this article we define the Radius plot of a graph and show how it can answer these questions. However, computing the Radius...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on knowledge discovery from data 2011-02, Vol.5 (2)
Hauptverfasser: Kang, U, Tsourakakis, Charalampos E, Appel, Ana Paula, Faloutsos, Christos, Leskovec, Jure
Format: Artikel
Sprache:eng
Schlagworte:
Computation
Data mining
Graphs
Mining
Outliers (statistics)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Given large, multimillion-node graphs (e.g., Facebook, Web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers? In this article we define the Radius plot of a graph and show how it can answer these questions. However, computing the Radius plot is prohibitively expensive for graphs reaching the planetary scale.
ISSN:1556-4681
DOI:10.1145/237814.237823