Grube, Tim ; Volk, Florian ; Mühlhäuser, Max ; Bhairav, Suhas ; Sachidananda, Vinay ; Elovici, Yuval (2018)
User-guided Graph Exploration: A Framework for Algorithmic Complexity Reduction in Large Data Sets.
In: International Journal On Advances in Intelligent Systems, 11 (12)
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
Human exploration of large data sets becomes increasingly difficult with growing amounts of data. For this purpose, such data sets are often visualized as large graphs, depicting information and interrelations as interconnected vertices. A visual representation of such large graphs (for example, social networks, collaboration analyses or biological data sets) has to find a trade-off between showing details in a magnified—or zoomed-in—view and the overall graph structure. Showing these two aspects at the same time results in a visual overload that is largely inaccessible to human users. In this article, we augment previous work and present a new approach to address this overload by combining and extending graph-theoretic properties with community detection algorithms. Our non-destructive approach to reducing visual complexity while retaining core properties of the given graph is user-guided and semi-automated. The results yielded by applying our approach to large real-world network data sets reveal a massive reduction of displayed vertices and connections while keeping essential graph structures intact.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2018 |
| Autor(en): | Grube, Tim ; Volk, Florian ; Mühlhäuser, Max ; Bhairav, Suhas ; Sachidananda, Vinay ; Elovici, Yuval |
| Art des Eintrags: | Bibliographie |
| Titel: | User-guided Graph Exploration: A Framework for Algorithmic Complexity Reduction in Large Data Sets |
| Sprache: | Englisch |
| Publikationsjahr: | 30 Juni 2018 |
| Ort: | Athens, Greece |
| Verlag: | IARIA |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | International Journal On Advances in Intelligent Systems |
| Jahrgang/Volume einer Zeitschrift: | 11 |
| (Heft-)Nummer: | 12 |
| Buchtitel: | International Journal |
| URL / URN: | http://thinkmind.org/index.php?view=article&articleid=intsys... |
| Kurzbeschreibung (Abstract): | Human exploration of large data sets becomes increasingly difficult with growing amounts of data. For this purpose, such data sets are often visualized as large graphs, depicting information and interrelations as interconnected vertices. A visual representation of such large graphs (for example, social networks, collaboration analyses or biological data sets) has to find a trade-off between showing details in a magnified—or zoomed-in—view and the overall graph structure. Showing these two aspects at the same time results in a visual overload that is largely inaccessible to human users. In this article, we augment previous work and present a new approach to address this overload by combining and extending graph-theoretic properties with community detection algorithms. Our non-destructive approach to reducing visual complexity while retaining core properties of the given graph is user-guided and semi-automated. The results yielded by applying our approach to large real-world network data sets reveal a massive reduction of displayed vertices and connections while keeping essential graph structures intact. |
| Freie Schlagworte: | - SST - Area Smart Security and Trust,- SSI - Area Secure Smart Infrastructures, SPIN: Smart Protection in Infrastructures and Networks |
| ID-Nummer: | TUD-CS-2017-0204 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Telekooperation |
| Hinterlegungsdatum: | 11 Jun 2019 11:50 |
| Letzte Änderung: | 14 Jun 2021 06:14 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum