Untangling hairballs : From 3 to 14 degrees of separation

Nocaj, Arlind; Ortmann, Mark; Brandes, Ulrik

Untangling hairballs : From 3 to 14 degrees of separation

Dateien

Nocaj_0-284485.pdfGröße: 347.24 KBDownloads: 442

Datum

2014

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

CHRISTIAN DUNCAN ..., , ed.. Graph Drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 ; revised selected papers. Berlin [u.a.]: Springe, 2014, pp. 101-112. Lecture Notes in Computer Science. 8871. ISBN 978-3-662-45802-0. Available under: doi: 10.1007/978-3-662-45803-7_9

Zusammenfassung

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.

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.

Fachgebiet (DDC)

004 Informatik

Konferenz

22nd International Symposium, Graph Drawing 2014, 24. Sept. 2014 - 26. Sept. 2014, Würzburg

Zitieren

ISO 690

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. Sept. 2014 - 26. Sept. 2014. In: CHRISTIAN DUNCAN ..., , ed.. Graph Drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 ; revised selected papers. Berlin [u.a.]: Springe, 2014, pp. 101-112. Lecture Notes in Computer Science. 8871. ISBN 978-3-662-45802-0. Available under: doi: 10.1007/978-3-662-45803-7_9

BibTex

@inproceedings{Nocaj2014Untan-30583,
  year={2014},
  doi={10.1007/978-3-662-45803-7_9},
  title={Untangling hairballs : From 3 to 14 degrees of separation},
  number={8871},
  isbn={978-3-662-45802-0},
  publisher={Springe},
  address={Berlin [u.a.]},
  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}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/30583">
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:title>Untangling hairballs : From 3 to 14 degrees of separation</dcterms:title>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:creator>Ortmann, Mark</dc:creator>
    <dcterms:issued>2014</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/30583/1/Nocaj_0-284485.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:creator>Nocaj, Arlind</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/30583"/>
    <dcterms:abstract xml:lang="eng">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.&lt;br /&gt;&lt;br /&gt;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.</dcterms:abstract>
    <dc:contributor>Ortmann, Mark</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-03-27T09:48:42Z</dc:date>
    <dc:language>eng</dc:language>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/30583/1/Nocaj_0-284485.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-03-27T09:48:42Z</dcterms:available>
    <dc:contributor>Nocaj, Arlind</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja