KOPS - Das Institutionelle Repositorium der Universität Konstanz

Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks

Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks


Dateien zu dieser Ressource

Prüfsumme: MD5:3bdcbdede2b3b50bc5c7c004e5b33ee7

NOCAJ, Arlind, Mark ORTMANN, Ulrik BRANDES, 2015. Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks. In: Journal of Graph Algorithms and Applications : JGAA. 19(2), pp. 595-618. eISSN 1526-1719

@article{Nocaj2015Untan-32889, title={Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks}, year={2015}, doi={10.7155/jgaa.00370}, number={2}, volume={19}, journal={Journal of Graph Algorithms and Applications : JGAA}, pages={595--618}, author={Nocaj, Arlind and Ortmann, Mark and Brandes, Ulrik} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/32889"> <dc:contributor>Brandes, Ulrik</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-02-05T10:19:03Z</dcterms:available> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/32889"/> <dcterms:title>Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks</dcterms:title> <dc:creator>Brandes, Ulrik</dc:creator> <dc:creator>Ortmann, Mark</dc:creator> <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, for instance, with graphs of high density or high conductance, or in the presence of high-degree vertices, all of which tend to pull vertices together and thus result in clutter overspreading variation in local density. We here propose a method specifically for a class of small-world graphs that are typical for online social networks. 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 criterion for structural 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 small-world graph prior to the application of a clustering algorithm.</dcterms:abstract> <dcterms:issued>2015</dcterms:issued> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="http://nbn-resolving.de/urn:nbn:de:bsz:352-20150914100631302-4485392-8"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-02-05T10:19:03Z</dc:date> <dc:creator>Nocaj, Arlind</dc:creator> <dc:contributor>Nocaj, Arlind</dc:contributor> <dc:contributor>Ortmann, Mark</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 05.02.2016 (Informationen über die Zugriffsstatistik)

Brandes_0-311019.pdf 68

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto