Name
Abstract | ||
|---|---|---|
Knowledge graphs play a central role for linking different data which leads to multiple layers. Thus, they are widely used in big data integration, especially for connecting data from different domains. Few studies have investigated the questions how multiple layers within graphs impact methods and algorithms developed for single-purpose networks, for example social networks. This manuscript investigates the impact of multiple layers on centrality measures compared to single-purpose graph. In particular, (a) we develop an experimental environment to (b) evaluate two different centrality measures - degree and betweenness centrality - on random graphs inspired by social network analysis: small-world and scale-free networks. The presented approach (c) shows that the graph structures and topology has a great impact on its robustness for additional data stored. Although the experimental analysis of random graphs allows us to make some basic observations we will (d) make suggestions for additional research on particular graph structures that have a great impact on the stability of networks. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.15439/2022F43 | Conference on Computer Science and Intelligence Systems (FedCSIS) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jens Dörpinghaus | 1 | 0 | 1.35 |
| Vera Weil | 2 | 1 | 2.65 |
| Carsten Düing | 3 | 0 | 0.34 |
| Martin W. Sommer | 4 | 0 | 0.34 |