Szczegóły publikacji
Opis bibliograficzny
Comparison of large graphs using distance information / Wojciech CZECH, Wojciech Mielczarek, Witold DZWINEL // W: Parallel Processing and Applied Mathematics : 11th international conference, PPAM 2015 : Krakow, Poland, September 6–9, 2015 : revised selected papers, Pt. 1 / eds. Roman Wyrzykowski, [et al.]. — Swizerland : Springer International Publishing, cop. 2016. — (Lecture Notes in Computer Science ; ISSN 0302-9743 ; 9573). — ISBN: 978-3-319-32148-6; e-ISBN: 978-3-319-32149-3. — S. 195–206. — Bibliogr. s. 205–206, Abstr.
Autorzy (3)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 97585 |
|---|---|
| Data dodania do BaDAP | 2016-05-10 |
| DOI | 10.1007/978-3-319-32149-3_19 |
| Rok publikacji | 2016 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | Parallel Processing and Applied Mathematics |
| Czasopisma/serie | Lecture Notes in Computer Science, Theoretical Computer Science and General Issues |
Abstract
We present a new framework for analysis and visualization of large complex networks based on structural information retrieved from their distance k-graphs and B-matrices. The construction of B-matrices for graphs with more than 1 million edges requires massive BFS computations and is facilitated using Cassovary - an open-source in-memory graph processing engine. The approach described in this paper enables efficient generation of expressive, multi-dimensional descriptors useful in graph embedding and graph mining tasks. In experimental section, we present how the developed tools helped in the analysis of real-world graphs from Stanford Large Network Dataset Collection.