FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3034725156> ?p ?o ?g. }

• W3034725156 abstract "The amount of RDF data available increases fast both in size and complexity, making available RDF Knowledge Bases (KBs) with millions or even billions of triples something usual, e.g. more than 1000 datasets are now published as part of the Linked Open Data (LOD) cloud, which contains more than 62 billion RDF triples, forming big and complex RDF data graphs. This explosion of size, complexity and number of available RDF Knowledge Bases (KBs) and the emergence of Linked Datasets made querying, exploring, visualizing, and understanding the data in these KBs difficult both from a human (when trying to visualize) and a machine (when trying to query or compute) perspective. To tackle this problem, we propose a method of summarizing a large RDF KBs based on representing the RDF graph using the (best) top-k approximate RDF graph patterns. The method is named SemSum+ and extracts the meaningful/descriptive information from RDF Knowledge Bases and produces a succinct overview of these RDF KBs. It extracts from the RDF graph, an RDF schema that describes the actual contents of the KB, something that has various advantages even compared to an existing schema, which might be partially used by the data in the KB. While computing the approximate RDF graph patterns, we also add information on the number of instances each of the patterns represents. So, when we query the RDF summary graph, we can easily identify whether the necessary information is present and if it is present in significant numbers whether to be included in a federated query result. The method we propose does not require the presence of the initial schema of the KB and works equally well when there is no schema information at all (something realistic with modern KBs that are constructed either ad-hoc or by merging fragments of other existing KBs). Additionally, the proposed method works equally well with homogeneous (having the same structure) and heterogeneous (having different structure, possibly the result of data described under different schemas/ontologies) RDF graphs.Given that RDF graphs can be large and complex, methods that need to compute the summary by fitting the whole graph in the memory of a (however large) machine will not scale. In order to overcome this problem, we proposed, as part of this thesis, a parallel framework that allows us to have a scalable parallel version of our proposed method. This will allow us to compute the summaries of any RDF graph regardless of size. Actually, we generalized this framework so as to be usable by any approximate pattern mining algorithm that needs parallelization.But working on this problem, introduced us to the issue of measuring the quality of the produced summaries. Given that in the literature exist various algorithms that can be used to summarize RDF graphs, we need to understand which one is better suited for a specific task or a specific RDF KB. In the literature, there is a lack of widely accepted evaluation criteria or an extensive empirical evaluation. This leads to the necessity of a method to compare and evaluate the quality of the produced summaries. So, in this thesis, we provide a comprehensive Quality Framework for RDF Graph Summarization to cover the gap that exists in the literature. This framework allows a better, deeper and more complete understanding of the quality of the different summaries and facilitates their comparison. It is independent of the way RDF summarization algorithms work and makes no assumptions on the type or structure neither of the input nor of the final results. We provide a set of metrics that help us understand not only if this is a valid summary but also how a summary compares to another in terms of the specified quality characteristic(s). The framework has the ability, which was experimentally validated, to capture subtle differences among summaries and produce metrics that depict that and was used to provide an extensive experimental evaluation and comparison of our method." @default.
• W3034725156 created "2020-06-19" @default.
• W3034725156 creator A5000476929 @default.
• W3034725156 date "2019-09-20" @default.
• W3034725156 modified "2023-09-23" @default.
• W3034725156 title "Querying semantic web/linked data graphs using summarization" @default.
• W3034725156 hasPublicationYear "2019" @default.
• W3034725156 type Work @default.
• W3034725156 sameAs 3034725156 @default.
• W3034725156 citedByCount "0" @default.
• W3034725156 crossrefType "dissertation" @default.
• W3034725156 hasAuthorship W3034725156A5000476929 @default.
• W3034725156 hasConcept C132525143 @default.
• W3034725156 hasConcept C147497476 @default.
• W3034725156 hasConcept C15657843 @default.
• W3034725156 hasConcept C157595922 @default.
• W3034725156 hasConcept C170858558 @default.
• W3034725156 hasConcept C2129575 @default.
• W3034725156 hasConcept C23123220 @default.
• W3034725156 hasConcept C29321653 @default.
• W3034725156 hasConcept C2987255567 @default.
• W3034725156 hasConcept C41008148 @default.
• W3034725156 hasConcept C41009113 @default.
• W3034725156 hasConcept C69075417 @default.
• W3034725156 hasConcept C78923513 @default.
• W3034725156 hasConcept C80444323 @default.
• W3034725156 hasConceptScore W3034725156C132525143 @default.
• W3034725156 hasConceptScore W3034725156C147497476 @default.
• W3034725156 hasConceptScore W3034725156C15657843 @default.
• W3034725156 hasConceptScore W3034725156C157595922 @default.
• W3034725156 hasConceptScore W3034725156C170858558 @default.
• W3034725156 hasConceptScore W3034725156C2129575 @default.
• W3034725156 hasConceptScore W3034725156C23123220 @default.
• W3034725156 hasConceptScore W3034725156C29321653 @default.
• W3034725156 hasConceptScore W3034725156C2987255567 @default.
• W3034725156 hasConceptScore W3034725156C41008148 @default.
• W3034725156 hasConceptScore W3034725156C41009113 @default.
• W3034725156 hasConceptScore W3034725156C69075417 @default.
• W3034725156 hasConceptScore W3034725156C78923513 @default.
• W3034725156 hasConceptScore W3034725156C80444323 @default.
• W3034725156 hasOpenAccess W3034725156 @default.
• W3034725156 hasRelatedWork W1563056472 @default.
• W3034725156 hasRelatedWork W1809515864 @default.
• W3034725156 hasRelatedWork W1966248695 @default.
• W3034725156 hasRelatedWork W2002856639 @default.
• W3034725156 hasRelatedWork W2103234914 @default.
• W3034725156 hasRelatedWork W2184496866 @default.
• W3034725156 hasRelatedWork W2264734033 @default.
• W3034725156 hasRelatedWork W2338508724 @default.
• W3034725156 hasRelatedWork W2404607645 @default.
• W3034725156 hasRelatedWork W2436992094 @default.
• W3034725156 hasRelatedWork W2491679527 @default.
• W3034725156 hasRelatedWork W2784526997 @default.
• W3034725156 hasRelatedWork W2806002160 @default.
• W3034725156 hasRelatedWork W2893233607 @default.
• W3034725156 hasRelatedWork W2901791698 @default.
• W3034725156 hasRelatedWork W2914357712 @default.
• W3034725156 hasRelatedWork W2953040647 @default.
• W3034725156 hasRelatedWork W3007408226 @default.
• W3034725156 hasRelatedWork W3137801862 @default.
• W3034725156 hasRelatedWork W3166613461 @default.
• W3034725156 isParatext "false" @default.
• W3034725156 isRetracted "false" @default.
• W3034725156 magId "3034725156" @default.
• W3034725156 workType "dissertation" @default.