Untangling hairballs : From 3 to 14 degrees of separation

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:63b7497308c5b526fae50de0aace3fa2

NOCAJ, Arlind, Mark ORTMANN, Ulrik BRANDES, 2014. Untangling hairballs : From 3 to 14 degrees of separation. 22nd International Symposium, Graph Drawing 2014. Würzburg, 24. Sep 2014 - 26. Sep 2014. In: CHRISTIAN DUNCAN ..., , ed.. Graph Drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 ; revised selected papers. 22nd International Symposium, Graph Drawing 2014. Würzburg, 24. Sep 2014 - 26. Sep 2014. Berlin [u.a.]:Springe, pp. 101-112. ISBN 978-3-662-45802-0

@inproceedings{Nocaj2014Untan-30583, title={Untangling hairballs : From 3 to 14 degrees of separation}, year={2014}, doi={10.1007/978-3-662-45803-7_9}, number={8871}, isbn={978-3-662-45802-0}, address={Berlin [u.a.]}, publisher={Springe}, series={Lecture Notes in Computer Science}, booktitle={Graph Drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 ; revised selected papers}, pages={101--112}, editor={Christian Duncan ...}, author={Nocaj, Arlind and Ortmann, Mark and Brandes, Ulrik} }

Small-world graphs have characteristically low average distance and thus cause force-directed methods to generate drawings that look like hairballs. This is by design as the inherent objective of these methods is a globally uniform edge length or, more generally, accurate distance representation. The problem arises in graphs of high density or high conductance, and in the presence of high-degree vertices, all of which tend to pull vertices together and thus clutter variation in local density.<br /><br />We here propose a method to draw online social networks, a special class of hairball graphs. The method is based on a spanning subgraph that is sparse but connected and consists of strong ties holding together communities. To identify these ties we propose a novel measure of embeddedness. It is based on a weighted accumulation of triangles in quadrangles and can be determined efficiently. An evaluation on empirical and generated networks indicates that our approach improves upon previous methods using other edge indices. Although primarily designed to achieve more informative drawings, our spanning subgraph may also serve as a sparsifier that trims a hairball graph before the application of a clustering algorithm. Brandes, Ulrik eng Nocaj, Arlind 2015-03-27T09:48:42Z 2015-03-27T09:48:42Z Ortmann, Mark Nocaj, Arlind 2014 Brandes, Ulrik Untangling hairballs : From 3 to 14 degrees of separation Ortmann, Mark

Dateiabrufe seit 27.03.2015 (Informationen über die Zugriffsstatistik)

Nocaj_0-284485.pdf 5

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto