Search

Driven by economic globalisation, various industries have developed a trend towards high specialisation and vertical division of labor, resulting in vast and intricate supply chain networks. However, unforeseen disasters can cause supply chain disruptions, subsequently impacting the regular production and operations of both upstream and downstream enterprises. To tackle this challenge, this study utilises Graph Neural Networks (GNNs) to synthesise graph structural data within the supply chain network, aiming to identify alternative suppliers to mitigate the impact of disruptions. We construct a large-scale knowledge graph to represent the realistic automotive supply chain network in China. Additionally, we propose a GNN-based framework that utilises information about interactions between buyers and suppliers to recommend alternative suppliers from the knowledge graph. Experimental results show that our approach significantly outperforms state-of-the-art GNN-based models, including Light-GCN and NGCF. Our research provides an intelligent and efficient perspective on supplier selection for the Chinese automobile industry. [ABSTRACT FROM AUTHOR]

The deployment of the Industrial Internet of Things (IIoT) in smart container terminals provides a foundation for sensing and recording all operational processes. However, little effort has been devoted to integrating the massive data regarding interoperability challenges, thus limiting the value of data in advancing the intelligent evolution of ports. In this research, we propose a graph-based approach to organise operational records semantically, thereby facilitating data-driven decision-making in container terminals. We first construct a knowledge graph for operational processes in container terminals, employing a tailored procedure for the automatic conversion of operational records into triples. By utilising the graph information, we propose a novel method that integrates reinforcement learning (RL) with a mathematical solver for optimising scheduling problems. The quay crane scheduling problem (QCSP) is illustrated as an example to elaborate on the technical details. Based on a dataset from a real-world container terminal, numerical studies demonstrate the superiority of the proposed framework in terms of information retrieval efficiency and solution quality compared with the traditional data organisation approach. [ABSTRACT FROM AUTHOR]

Modern supply chains are complex, interconnected systems that contain emergent, invisible dependencies. Lack of visibility often hinders effective risk planning and results in delayed discovery of supply chain problems, with examples ranging from product contamination, unsustainable production practices, or exposure to suppliers clustered in geographical areas prone to natural or man-made disasters. Initiatives that rely on manual collection of data often fail due to supply chain complexity and unwillingness of suppliers to share data. In this paper, we propose a neurosymbolic machine learning technique to proactively uncover hidden risks in supply chains and discover new information. Our method uses a combination of graph neural networks and knowledge graph reasoning. Unlike existing research our model is able to infer multiple types of hidden relationship risks, presenting a step change in automated supply chain surveillance. The approach has been tested on two empirical datasets from the automotive and energy industries, illustrating that it can provide inference in multiple types of links such as companies, products, production capabilities, certifications; thereby facilitating complex queries that go beyond who-supplies-whom. As such, additional risk insights can emerge from graph structure, providing practitioners with new knowledge. [ABSTRACT FROM AUTHOR]

The increasing complexity of industrial systems demands more effective and intelligent maintenance approaches to address manufacturing defects arising from faults in multiple asset modules. Traditional digital twin (DT) systems, however, face limitations in interoperability, knowledge sharing, and causal inference. As such, cognitive digital twins (CDTs) can add value by managing a collaborative web of interconnected systems, facilitating advanced cross-domain analysis and dynamic context considerations. This paper introduces a CDT system that leverages industrial knowledge graphs (iKGs) to support maintenance planning and operations. By employing a design structure matrix (DSM) to model dependencies and relationships, a semantic translation approach maps the knowledge into a graph-based representation for reasoning and analysis. An automatic solution generation mechanism, utilising graph sequencing with Louvain and PageRank algorithms, derives feasible solutions, which can be validated via simulation to minimise production disruption impacts. The CDT system can also identify potential disruptions in new product designs, thus enabling preventive actions to be taken. A case study featuring a print production manufacturing line illustrates the CDT system's capabilities in causal inference and solution explainability. The study concludes with a discussion of limitations and future directions, providing valuable guidelines for manufacturers aiming to enhance reactive and predictive maintenance strategies. [ABSTRACT FROM AUTHOR]

BackgroundOntologies are fundamental components of informatics infrastructure in domains such as biomedical, environmental, and food sciences, representing consensus knowledge in an accurate and computable form. However, their construction and maintenance demand substantial resources and necessitate substantial collaboration between domain experts, curators, and ontology experts. We present Dynamic Retrieval Augmented Generation of Ontologies using AI (DRAGON-AI), an ontology generation method employing Large Language Models (LLMs) and Retrieval Augmented Generation (RAG). DRAGON-AI can generate textual and logical ontology components, drawing from existing knowledge in multiple ontologies and unstructured text sources.ResultsWe assessed performance of DRAGON-AI on de novo term construction across ten diverse ontologies, making use of extensive manual evaluation of results. Our method has high precision for relationship generation, but has slightly lower precision than from logic-based reasoning. Our method is also able to generate definitions deemed acceptable by expert evaluators, but these scored worse than human-authored definitions. Notably, evaluators with the highest level of confidence in a domain were better able to discern flaws in AI-generated definitions. We also demonstrated the ability of DRAGON-AI to incorporate natural language instructions in the form of GitHub issues.ConclusionsThese findings suggest DRAGON-AI's potential to substantially aid the manual ontology construction process. However, our results also underscore the importance of having expert curators and ontology editors drive the ontology generation process.

Micro, Small, and Medium-sized Enterprises (MSMEs) are essential for the growth and development of the country's economy, as they create jobs, generate income, and foster production and innovation. In recent years, credit risk assessment (CRA) has been an essential process used by financial institutions to evaluate the creditworthiness of MSMEs and determine the likelihood of default. Traditionally, CRA has relied on credit scores and financial statements, but with the advent of machine learning (ML) algorithms, lenders have a new tool at their disposal. By and large, ML algorithms are designed to classify borrowers based on their credit history and transactional data while leveraging the entity relationship involved in credit transactions. This study introduces an innovative knowledge graph-driven credit risk assessment model (RGCN-RF) based on the Relational Graph Convolutional Network (RGCN) and Random Forest (RF) algorithm. RGCN is employed to identify topological structures and relationships, which is currently nascent in traditional credit risk assessment methods. RF categorises MSMEs based on the enterprise embedding vector generated from RGCN. Extensive experimentation is conducted to assess model performance utilising the Indian MSMEs database. The balanced accuracy of 92% obtained using the RGCN-RF model demonstrates a considerable advancement over prior techniques in identifying risk-free enterprises. [ABSTRACT FROM AUTHOR]

Feature selection in Knowledge Graphs (KGs) is increasingly utilized in diverse domains, including biomedical research, Natural Language Processing (NLP), and personalized recommendation systems. This paper delves into the methodologies for feature selection (FS) within KGs, emphasizing their roles in enhancing machine learning (ML) model efficacy, hypothesis generation, and interpretability. Through this comprehensive review, we aim to catalyze further innovation in FS for KGs, paving the way for more insightful, efficient, and interpretable analytical models across various domains. Our exploration reveals the critical importance of scalability, accuracy, and interpretability in FS techniques, advocating for the integration of domain knowledge to refine the selection process. We highlight the burgeoning potential of multi-objective optimization and interdisciplinary collaboration in advancing KG FS, underscoring the transformative impact of such methodologies on precision medicine, among other fields. The paper concludes by charting future directions, including the development of scalable, dynamic FS algorithms and the integration of explainable AI principles to foster transparency and trust in KG-driven models.

Narrator disambiguation is a field within hadith science that studies unidentified narrators in hadith narration chains, also known as sanads. Sanads can be represented as graphs, with the nodes representing the narrators and the edges representing their relationships in the chain. The current methods for resolving the narrator disambiguation problem do not utilize the graph structure of the sanad, but by leveraging this structure, we can apply graph computational and deep learning techniques to identify narrators. This paper introduces a method that utilizes the sanad graph structure to identify all narrators in a given sanad. Our two-stage approach begins by generating a query embedding and identifying the top k narrator entities closest to the query embedding. We then use AraBERT to re-rank the top k narrators and make the final prediction. Our method achieves 94.6% accuracy on the validation set of AR-Sanad 280K dataset. Additionally, we present AR-Sanad 280K-v2, an updated dataset that represents real hadiths more accurately. [ABSTRACT FROM AUTHOR]

Summary: In sedimentology, the integration of intelligent engineering decision‐making with edge computing environments aims to furnish engineers and decision‐makers with precise, real‐time insights into sediment‐related issues. This approach markedly reduces data transfer time and response latency by harnessing the computational power of edge computing, thereby bolstering the decision‐making process. Concurrently, the establishment of a sediment knowledge graph serves as a pivotal conduit for disseminating sediment‐related knowledge in the realm of intelligent engineering decision‐making. Moreover, it facilitates a comprehensive exploration of the intricate evolutionary and transformative processes inherent in sediment materials. By unveiling the evolutionary trajectory of life on Earth, the sediment knowledge graph catalyzes a deeper understanding of our planet's history and dynamics. Relationship extraction, as a key step in knowledge graph construction, implements automatic extraction and establishment of associations between entities from a large amount of sedimentary literature data. However, sedimentological literature presents multi‐source heterogeneous features, which leads to a weak representation of hidden relationships, thus decreasing the accuracy of relationship extraction. In this article, we propose an attribute‐extended relation extraction approach (AERE), which is specifically designed for sedimentary relation extraction scenarios. First, context statements containing sediment entities are obtained from the literature. Then, a cohesive hierarchical clustering algorithm is used to extend the relationship attributes between sediments. Finally, mine the relationships between entities based on AERE. The experimental results show that the proposed model can effectively extract the hidden relations and exhibits strong robustness in dealing with redundant noise before and after sentences, which in turn improves the completeness of the relations between deposits. After the relationship extraction, a proprietary sediment knowledge graph is constructed with the extracted triads. [ABSTRACT FROM AUTHOR]

ABSTRACT The growing global interest in Geographic Information System/Science (GIS) programs has led to an increased demand for higher education in this field. However, students often struggle to identify suitable programs and faculty due to the overwhelming options and the lack of personalized guidance. This paper presents GISphere‐KG, an AI‐powered platform based on the GISphere project. It combines knowledge graph (KG) and large language models (LLMs) to enhance the search and recommendation of GIS‐related graduate programs. GISphere‐KG offers four key features: (1) interactive conversation that provides natural language responses to applicants' inquiries; (2) efficient information retrieval through semantic relationships built within the KG; (3) discovery of professors whose research interests align with those of the applicants, offering more choices within specific research fields; and (4) personalized program recommendations tailored to applicants' academic and career developments. Our platform aims to provide a user‐friendly tool that assists prospective students in achieving their career goals and enriching the geography community by attracting more talent and promoting global geography education. [ABSTRACT FROM AUTHOR]

ABSTRACT High‐precision, multi‐source landslide monitoring data are crucial for disaster prevention and management. These datasets provide explicit landslide descriptions. Integrating this data with landslide mechanisms, using knowledge graphs can enhance early monitoring and forecasting. However, traditional knowledge graphs often oversimplify landslide knowledge, failing to capture the complexity of geological environments and landslide evolution. Spatio‐temporal knowledge graphs face challenges in representing intricate relationships. A hypergraph (HG), where an edge connects multiple nodes, offers a better representation of these complexities. This paper proposes an HG‐based method for landslide knowledge representation, organizing multi‐source information and knowledge through binary or multiple relationships under specific temporal and spatial conditions. A case study of the Miaodian landslide, which experienced multiple sliding events, shows that the proposed landslide knowledge HG outperforms other knowledge graphs like YAGO, Geographic Knowledge Graph (GeoKG), and Geographic Evolutionary Knowledge Graph (GEKG) in completeness, accuracy, and redundancy, demonstrating its effectiveness. [ABSTRACT FROM AUTHOR]

A majority of research in Computational Thinking (CT) mainly focuses on teaching coding to school students. However, CT involves more than just coding and includes other skills like algorithmic thinking. The current study developed an Online Inquiry-based Learning Platform for Computational Thinking (CT-ONLINQ) that follows Inquiry-Based Learning (IBL) pedagogy to support CT activities. IBL-based CT steps include algorithm design, analysis, and comparison of algorithms. Also, the platform allows students to explore multiple solutions to a problem and provides multiple-try feedback with hints as support during problem-solving activities. The hint generation strategy uses a Knowledge Graph that captures knowledge about the problem's solution in a machine-processible form. A six-week quasi-experimental study was conducted to determine the effectiveness of multiple-try feedback with hints on students' CT skills. The study included 79 high school students: 41 students as part of the experimental group (EG) were provided problem-specific hints, and 38 as part of the control group (CG) with CT-general hints. The results showed that the students in the EG group improved their CT skills significantly more than those in the CG group. In addition, the study also evaluates the effectiveness of intervention considering biases in gender and prior coding experience. Female students performed better than male students in both groups after the intervention. Furthermore, in EG group, observations showed that students without coding experience performed better than their counterparts with experience. The findings suggest that the IBL-based CT activity on CT-ONLINQ can be deployed to improve the CT skills of school students. [ABSTRACT FROM AUTHOR]

In the rapidly advancing information era, various human behaviors are being precisely recorded in the form of data, including identity information, criminal records, and communication data. Law enforcement agencies can effectively maintain social security and precisely combat criminal activities by analyzing the aforementioned data. In comparison to traditional data analysis methods, deep learning models, relying on the robust computational power in cloud centers, exhibit higher accuracy in extracting data features and inferring data. However, within the architecture of cloud centers, the transmission of data from end devices introduces significant latency, hindering real-time inference of data. Furthermore, low-latency edge computing architectures face limitations in direct deployment due to relatively weak computing and storage capacities of nodes. To address these challenges, a lightweight distributed knowledge graph completion architecture is proposed. Firstly, we introduce a lightweight distributed knowledge graph completion architecture that utilizes knowledge graph embedding for data analysis. Subsequently, to filter out substandard data, a personnel data quality assessment method named PDQA is proposed. Lastly, we present a model pruning algorithm that significantly reduces the model size while maximizing performance, enabling lightweight deployment. In experiments, we compare the effects of 11 advanced models on completing the knowledge graph of public security personnel information. The results indicate that the RotatE model outperforms other models significantly in knowledge graph completion, with the pruned model size reduced by 70%, and hits@10 reaching 86.97%. [ABSTRACT FROM AUTHOR]

Over the past ten years, large amounts of original research data related to Earth system science have been made available at a rapidly increasing rate. Such growing data stock helps researchers understand the human-Earth system across different fields. A substantial amount of this data is published by geoscientists as open-access in authoritative journals. If the information stored in this literature is properly extracted, there is significant potential to build a domain knowledge base. However, this potential remains largely unfulfilled in geoscience, with one of the biggest obstacles being the lack of publicly available related corpora and baselines. To fill this gap, the Earth Science Data Corpus (ESDC), an academic text corpus of 600 abstracts, was built from the international journal Earth System Science Data (ESSD). To the best of our knowledge, ESDC is the first corpus with the needed detail to provide a professional training dataset for knowledge extraction and construction of domain-specific knowledge graphs from massive amounts of literature. The production process of ESDC incorporates both the contextual features of spatiotemporal entities and the linguistic characteristics of academic literature. Furthermore, annotation guidelines and procedures tailored for Earth science data are formulated to ensure reliability. ChatGPT with zero- and few-shot prompting, BARTNER generative, and W2NER discriminative models were trained on ESDC to evaluate the performance of the name entity recognition task and showed increasing performance metrics, with the highest achieved by BARTNER. Performance metrics for various entity types output by each model were also assessed. We utilized the trained BARTNER model to perform model inference on a larger unlabeled literature corpus, aiming to automatically extract a broader and richer set of entity information. Subsequently, the extracted entity information was mapped and associated with the Earth science data knowledge graph. Around this knowledge graph, this paper validates multiple downstream applications, including hot topic research analysis, scientometric analysis, and knowledge-enhanced large language model question-answering systems. These applications have demonstrated that the ESDC can provide scientists from different disciplines with information on Earth science data, help them better understand and obtain data, and promote further exploration in their respective professional fields. [ABSTRACT FROM AUTHOR]

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users' potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users' potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. [ABSTRACT FROM AUTHOR]

Research in Natural Language Processing (NLP) is increasing rapidly; as a result, a large number of research papers are being published. It is challenging to find the contributions of the research paper in any specific domain from the huge amount of unstructured data. There is a need for structuring the relevant contributions in Knowledge Graph (KG). In this paper, we describe our work to accomplish four tasks toward building the Scientific Knowledge Graph (SKG). We propose a pipelined system that performs contribution sentence identification, phrase extraction from contribution sentences, Information Units (IUs) classification, and organize phrases into triplets (subject, predicate, object) from the NLP scholarly publications. We develop a multitasking system (ContriSci) for contribution sentence identification with two supporting tasks, viz.Section Identification and Citance Classification. We use the Bidirectional Encoder Representations from Transformers (BERT)—Conditional Random Field (CRF) model for the phrase extraction and train with two additional datasets: SciERC and SciClaim. To classify the contribution sentences into IUs, we use a BERT-based model. For the triplet extraction, we categorize the triplets into five categories and classify the triplets with the BERT-based classifier. Our proposed approach yields the F1 score values of 64.21%, 77.47%, 84.52%, and 62.71% for the contribution sentence identification, phrase extraction, IUs classification, and triplet extraction, respectively, for non-end-to-end setting. The relative improvement for contribution sentence identification, IUs classification, and triplet extraction is 8.08, 2.46, and 2.31 in terms of F1 score for the NLPContributionGraph (NCG) dataset. Our system achieves the best performance (57.54% F1 score) in the end-to-end pipeline with all four sub-tasks combined. We make our codes available at: https://github.com/92Komal/pipeline_triplet_extraction. [ABSTRACT FROM AUTHOR]

Detecting texts that contain semantic-level new information is not straightforward. The problem becomes more challenging for research articles. Over the years, many datasets and techniques have been developed to attempt automatic novelty detection. However, the majority of the existing textual novelty detection investigations are targeted toward general domains like newswire. A comprehensive dataset for scientific novelty detection is not available in the literature. In this paper, we present a new triplet-based corpus (SciND) for scientific novelty detection from research articles via knowledge graphs. The proposed dataset consists of three types of triples (i) triplet for the knowledge graph, (ii) novel triplets, and (iii) non-novel triplets. We build a scientific knowledge graph for research articles using triplets across several natural language processing (NLP) domains and extract novel triplets from the paper published in the year 2021. For the non-novel articles, we use blog post summaries of the research articles. Our knowledge graph is domain-specific. We build the knowledge graph for seven NLP domains. We further use a feature-based novelty detection scheme from the research articles as a baseline. Moreover, we show the applicability of our proposed dataset using our baseline novelty detection algorithm. Our algorithm yields a baseline F1 score of 72%. We show analysis and discuss the future scope using our proposed dataset. To the best of our knowledge, this is the very first dataset for scientific novelty detection via a knowledge graph. We make our codes and dataset publicly available at https://github.com/92Komal/Scientific_Novelty_Detection. [ABSTRACT FROM AUTHOR]

Understanding complex biological pathways, including gene–gene interactions and gene regulatory networks, is critical for exploring disease mechanisms and drug development. Manual literature curation of biological pathways cannot keep up with the exponential growth of new discoveries in the literature. Large‐scale language models (LLMs) trained on extensive text corpora contain rich biological information, and they can be mined as a biological knowledge graph. This study assesses 21 LLMs, including both application programming interface (API)‐based models and open‐source models in their capacities of retrieving biological knowledge. The evaluation focuses on predicting gene regulatory relations (activation, inhibition, and phosphorylation) and the Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway components. Results indicated a significant disparity in model performance. API‐based models GPT‐4 and Claude‐Pro showed superior performance, with an F1 score of 0.4448 and 0.4386 for the gene regulatory relation prediction, and a Jaccard similarity index of 0.2778 and 0.2657 for the KEGG pathway prediction, respectively. Open‐source models lagged behind their API‐based counterparts, whereas Falcon‐180b and llama2‐7b had the highest F1 scores of 0.2787 and 0.1923 in gene regulatory relations, respectively. The KEGG pathway recognition had a Jaccard similarity index of 0.2237 for Falcon‐180b and 0.2207 for llama2‐7b. Our study suggests that LLMs are informative in gene network analysis and pathway mapping, but their effectiveness varies, necessitating careful model selection. This work also provides a case study and insight into using LLMs das knowledge graphs. Our code is publicly available at the website of GitHub (Muh‐aza). [ABSTRACT FROM AUTHOR]

Multi-hop reasoning provides a means for inferring indirect relationships and missing information from knowledge graphs (KGs). Reinforcement learning (RL) was recently employed for multi-hop reasoning. Although RL-based methods provide explainability, they face challenges such as sparse rewards, spurious paths, large action spaces, and long training and running times. In this study, we present a novel approach that combines KG embeddings and RL strategies for multi-hop reasoning called path-based multi-hop reasoning (PMHR). We address the issues of sparse rewards and spurious paths by incorporating a well-designed reward function that combines soft rewards with rule-based rewards. The rewards are adjusted based on the target entity and the path to it. Furthermore, we perform action filtering and utilize the vectors of entities and relations acquired through KG embeddings to initialize the environment, thereby significantly reducing the runtime. Experiments involving a comprehensive performance evaluation, efficiency analysis, ablation studies, and a case study were performed. The experimental results on benchmark datasets demonstrate the effectiveness of PMHR in improving KG reasoning accuracy while preserving interpretability. Compared to existing state-of-the-art models, PMHR achieved Hit@1 improvements of 0.63%, 2.02%, and 3.17% on the UMLS, Kinship, and NELL-995 datasets, respectively. PMHR provides not only improved reasoning accuracy and explainability but also optimized computational efficiency, thereby offering a robust solution for multi-hop reasoning. [ABSTRACT FROM AUTHOR]

Automating the job hazard analysis (JHA) process is an urgent requirement in the construction safety management field due to limitations of the conventional process. The manual nature of conducting the JHA and the dynamic environment of construction sites make it necessary to perform the analysis before commencing the job and to then regularly update it in accordance with changes in the construction plans. With this in mind, this research aims to develop an automated approach to support safety personnel during the JHA process. In seeking to automate the JHA process, the nature of construction accidents, hazards and risk assessment needs to be studied in light of the theoretical knowledge on accident causation. Thus, this research was designed according to the constructive research approach to develop a job hazard analysis knowledge graph (JHAKG) to automate the JHA process. The JHAKG incorporated an ontology (O-JHAKG) built according to the systematic ontology development method, METHONTOLOGY, which formalises both explicit and implicit knowledge inherent in the JHA process. The data were imported to the JHAKG from an incident database using rule-based natural language processing (NLP) which helped to extract implicit information not evident in the traditional JHA document. The validation of the JHAKG was conducted in two stages: the first stage validated the information extraction process by calculating performance metrics, while the second stage validated the data population process and the JHAKG's reasoning capability. The overall research resulted in a comprehensive JHAKG with advanced inferencing capabilities which can assist safety personnel in effectively executing the JHA process. [ABSTRACT FROM AUTHOR]

The development of artificial intelligence models for data driven decision making has a lot of potential for the manufacturing sector. Nevertheless, applications in industry are currently limited to the actionable insights one can discover from the available data and knowledge of a manufacturing system. We call the process to obtain such insights "ad hoc analysis". Ad hoc analysis at system level is very complex in an industrial setting due to the inherent heterogeneity of data and existence of data silos, the lack of information and knowledge formalization, and the inability to meaningfully and efficiently reason about the data, information and knowledge. In this paper, we provide and outline a framework for ad hoc analysis in manufacturing based on knowledge graphs and influenced by the metamodelling paradigm. We derive its requirements and key elements from an analysis of several industry application cases. We show how manufacturing data, information and knowledge can be combined and made actionable using this framework. The framework supports workflows and tools for the data consumer (i.e., data scientist), and for the knowledge engineer. Furthermore, we show how the framework is integrated with existing data sources. Then, we discuss how we applied the framework to several application cases. We discuss how the framework contributes when applied, and what challenges still remain. [ABSTRACT FROM AUTHOR]