Proceedings of the 10th International Joint Conference on Knowledge Graphs 2021
DOI: 10.1145/3502223.3502243
|View full text |Cite
|
Sign up to set email alerts
|

Towards Ontology Reshaping for KG Generation with User-in-the-Loop: Applied to Bosch Welding

Abstract: Knowledge graphs (KG) are used in a wide range of applications. The automation of KG generation is very desired due to the data volume and variety in industries. One important approach of KG generation is to map the raw data to a given KG schema, namely a domain ontology, and construct the entities and properties according to the ontology. However, the automatic generation of such ontology is demanding and existing solutions are often not satisfactory. An important challenge is a trade-off between two principl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5
2
1

Relationship

4
4

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 53 publications
0
4
0
Order By: Relevance
“…The SPARQL is the language used to retrieve information and Hermit, Pallet, and RDFox are examples of reasoners found in the review. An important aspect of ontologies is that they are extendable and reusable [26,49,59].…”
Section: Discussionmentioning
confidence: 99%
“…The SPARQL is the language used to retrieve information and Hermit, Pallet, and RDFox are examples of reasoners found in the review. An important aspect of ontologies is that they are extendable and reusable [26,49,59].…”
Section: Discussionmentioning
confidence: 99%
“…The resulting ontology is a (compact) version of the original one and essentially consists of (1) all corresponding information (table names and attributes) from the raw data and (2) other essential connecting elements, which are partially from the original ontology and partially from users, to attain some optimality defined by user heuristics, efficiency, simplicity, etc. We adopt our OR algorithm [11]. In the nutshell OR firstly selects a subset of nodes and edges in the domain ontology [12], creating its sub-graph, which is a sparse sub-graph that consists of many disconnected small graph fragments; secondly, it extends the sub-graph to a KG schema with the help of two sources of information: (a) retaining other nodes and edges of the domain ontology to preserve part of its knowledge, (b) some optional information given by users (welding experts) that help to connect the fragments in the sub-graph.…”
Section: Our Approachmentioning
confidence: 99%
“…The executable KGs construction follows the task ontologies 𝑂 𝑣𝑖𝑠𝑢 , 𝑂 𝑠𝑡𝑎𝑡𝑠 , and 𝑂 𝑚𝑙 as schemata [15,16,18], and rely on KG templates [27,28], which are parameterised ontologies with pre-defined structures and a set of variables of entities and properties. We adopt a solution similar to Reasonable Ontology Templates framework [10].…”
Section: Executable Knowledge Graph Constructionmentioning
confidence: 99%