(2021). Scalable Community Detection for Complex Data Graphs via Hyperbolic Network Embedding and Graph Databases. IEEE Transactions on Network Science and Engineering, 8(2), 1269–1282. https://doi.org/10.1109/TNSE.2020.3022248
Περίληψη
Community detection and its variations is one of the typically employed approaches for analyzing graph data originating from various diverse fields. In this paper, we focus on a particular approach for community detection capitalizing on hyperbolic network embedding, which is aimed at analyzing large data graphs. In order to enable its scaling to arbitrary sized data sets and respective data graphs, we extend it by incorporating a graph database approach. This allows for handling a larger number of nodes and edges in the data graph. Also, we turn our focus on the discovery and visualization of communities in Resource Description Framework (RDF) data, namely over linked datasets from diverse areas, explaining how our approach can accommodate relevant analysis. We demonstrate the applicability of the new approach over both real-world and artificially generated datasets showing its feasibility in producing correct results, while being able to scale seamlessly in large datasets. The approach can be used for multi-lateral analysis of feature-rich graph data, originating from diverse sources, enabling the discovery of hidden correlations through the hyperbolic network embedding. © 2013 IEEE.
- DOI
- 10.1109/TNSE.2020.3022248
- Τύπος
- Άρθρο σε Περιοδικό
- Έτος
- 2021
Σύνδεσμοι
BibTeX
@article{tsitseklis2020scalable,
title = {Scalable Community Detection for Complex Data Graphs via Hyperbolic Network Embedding and Graph Databases},
author = {Konstantinos Tsitseklis and Maria Krommyda and Vasileios Karyotis and Verena Kantere and Symeon Papavassiliou},
url = {https://doi.org/10.1109/TNSE.2020.3022248},
doi = {10.1109/TNSE.2020.3022248},
year = {2021},
date = {2021-01-01},
urldate = {2020-01-01},
journal = {IEEE Transactions on Network Science and Engineering},
volume = {8},
number = {2},
pages = {1269--1282},
publisher = {IEEE},
abstract = {Community detection and its variations is one of the typically employed approaches for analyzing graph data originating from various diverse fields. In this paper, we focus on a particular approach for community detection capitalizing on hyperbolic network embedding, which is aimed at analyzing large data graphs. In order to enable its scaling to arbitrary sized data sets and respective data graphs, we extend it by incorporating a graph database approach. This allows for handling a larger number of nodes and edges in the data graph. Also, we turn our focus on the discovery and visualization of communities in Resource Description Framework (RDF) data, namely over linked datasets from diverse areas, explaining how our approach can accommodate relevant analysis. We demonstrate the applicability of the new approach over both real-world and artificially generated datasets showing its feasibility in producing correct results, while being able to scale seamlessly in large datasets. The approach can be used for multi-lateral analysis of feature-rich graph data, originating from diverse sources, enabling the discovery of hidden correlations through the hyperbolic network embedding. © 2013 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}