Analyzing longitudinal data in knowledge graphs utilizing shrinking pseudo-triangles

bibb.id782187
bibb.participationBIBB-Mitarbeiterde
dc.contributor.authorDörpinghaus, Jens [Verfasser]de
dc.contributor.authorWeil, Vera [Verfasser]de
dc.contributor.authorBinnewitt, Johanna [Verfasser]de
dc.date.accessioned2024-02-28T08:24:19Z
dc.date.available2024-02-28T08:24:19Z
dc.date.issued2022
dc.description.abstract"This paper aims to analyze longitudinal data, serial data related to different time points, in knowledge graphs. Knowledge graphs play a central role for linking different data. While multiple layers for data from different sources are considered, there is only very limited research on longitudinal data in knowledge graphs. However, knowledge graphs are widely used in big data integration, especially for connecting data from different domains. Few studies have investigated the questions how multiple layers and time points within graphs impact methods and algorithms developed for single-purpose networks. This manuscript investigates the impact of a modeling of longitudinal data in multiple layers on retrieval algorithms. In particular, (a) we propose a first draft of a generic model for longitudinal data in multi-layer knowledge graphs, (b) we develop an experimental environment to evaluate a generic retrieval algorithm on random graphs inspired by computational social sciences. We present a knowledge graph generated on German job advertisements comprising data from different sources, both structured and unstructured, on data between 2011 and 2021.The data is linked using text mining and natural language pro cessing methods. We further (c) present two different shrinking techniques for structured and unstructured layers in knowledge based on graph structures like triangles and pseudo-triangles. The presented approach (d) shows that on the one hand, the initial research questions, on the other hand the graph structures and topology have a great impact on the structures and efficiency for additional data stored. Although the experimental analysis of random graphs allows us to make some basic observations we will (e) make suggestions for additional research on particular graph structures that have a great impact on the analysis of knowledge graph structures." (Authors' abstract)de
dc.description.versionreferiert
dc.format.extentSeite 323-327de
dc.format.illustrationDiagrammede
dc.format.mediumElektronische Ressourcede
dc.format.mediumSammelbandbeitragde
dc.identifier.uriDOI:10.15439/2022F45
dc.identifier.urihttps://bibb-dspace.bibb.de/jspui/handle/BIBB/782187
dc.language.isoende
dc.rdacarrier.codecrde
dc.rdacarrier.sourcerdacontentde
dc.rdacarrier.termOnline-Ressourcede
dc.rdacontent.codetxtde
dc.rdacontent.sourcerdacontentde
dc.rdacontent.termTextde
dc.rdamedia.codecde
dc.rdamedia.sourcerdacontentde
dc.rdamedia.termComputermediende
dc.relation.ispartofProceedings of the 17th Conference on Computer Science and Intelligence Systems / Maria Ganzha [Hrsg.] ; Leszek Maciaszek [Hrsg.] ; Marcin Paprzycki [Hrsg.] ; Dominik Slezak [Hrsg.]
dc.subject.ddc370de
dc.subject.otherLängsschnittuntersuchungde
dc.subject.otherDatenanalysede
dc.subject.otherDatenmanagement
dc.titleAnalyzing longitudinal data in knowledge graphs utilizing shrinking pseudo-trianglesde

Files