Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Centrality Measures in multi-layer Knowledge Graphs
Federal Institute for Vocational Education and Training (BIBB), Germany;University Koblenz-Landau,, Germany.ORCID iD: 0000-0003-0245-7752
University of Cologne, Germany.
University Koblenz-Landau, Germany.
Argelander-Institut fur Astronomie, Germany.
2022 (English)In: Communication Papers of the of the 17th Conference on Computer Science and Intelligence Systems / [ed] M. Ganzha, L. Maciaszek, M. Paprzycki and D. Ślęzak, Polish information processing society (PTI) , 2022, p. 163-170Conference paper, Published paper (Refereed)
Abstract [en]

Knowledge graphs play a central role for linkingdifferent 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 on the centrality measures of graphs with multiple layers compared to a those measures in single-purpose graphs. 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.

Place, publisher, year, edition, pages
Polish information processing society (PTI) , 2022. p. 163-170
Series
Annals of Computer Science and Information Systems, E-ISSN 2300-5963 ; 32
National Category
Information Systems
Research subject
Computer and Information Sciences Computer Science, Information Systems
Identifiers
URN: urn:nbn:se:lnu:diva-131823DOI: 10.15439/2022f43ISBN: 9788396589743 (electronic)ISBN: 9788396589750 (electronic)OAI: oai:DiVA.org:lnu-131823DiVA, id: diva2:1889343
Conference
Communication Papers of the of the 17th Conference on Computer Science and Intelligence Systems
Available from: 2024-08-15 Created: 2024-08-15 Last updated: 2024-08-22Bibliographically approved

Open Access in DiVA

fulltext(350 kB)75 downloads
File information
File name FULLTEXT01.pdfFile size 350 kBChecksum SHA-512
bc7b00f56a11782e8f71ce5a45680e9a1c3333d8e21ebc6562b9cfbea90429fb25b4a417a1592bcf970f3f4dc6389d0aa2010fb553fa9e8a174ed4fee3bc646d
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Dörpinghaus, Jens
Information Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 76 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 76 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf