Generative AI has shown remarkable advancements across various tasks, including recommender systems, where recent research leverages generative approaches to provide personalised recommendations based on user-item historical interaction data. However, the inherent sparsity of the interaction data poses a significant challenge to the advancement of generative recommender models. While some discriminative models have explored incorporating knowledge graphs (KGs) to address this issue, they often struggle with noise sensitivity, lack of explainability, and difficulties in handling cold-start scenarios, where new items with little or no historical user interaction data are involved. In this paper, we propose a novel dual-architecture generative model that intuitively integrates a diffusion model with KG-based reasoning, which reflects the propagation of user preference in a KG towards items. Our approach not only improves recommendation accuracy significantly, but also introduces explainability by leveraging the structured insights from KGs. Furthermore, the KG-based reasoning enables our model to effectively address cold-start scenarios. By utilising the semantic connections in the KG, our model can recommend these new items with confidence, overcoming a common limitation of traditional methods. We evaluate our model on three benchmark datasets, demonstrating superior performance (beat SOTA by over 10% in recall@20 in average).

Abstract Knowledge Graph Embedding (KGE) has attracted increasing attention. Relation patterns, such as symmetry and inversion, have received considerable focus. Among them, composition patterns are particularly important, as they involve nearly all relations in KGs. However, prior KGE approaches often consider relations to be compositional only if they are well-represented in the training data. Consequently, it can lead to performance degradation, especially for under-represented composition patterns. To this end, we propose HolmE, a general form of KGE with its relation embedding space closed under composition, namely that the composition of any two given relation embeddings remains within the embedding space. This property ensures that every relation embedding can compose, or be composed by other relation embeddings. It enhances HolmE’s capability to model under-represented (also called long-tail) composition patterns with limited learning instances. To our best knowledge, our work is pioneering in discussing KGE with this property of being closed under composition. We provide detailed theoretical proof and extensive experiments to demonstrate the notable advantages of HolmE in modelling composition patterns, particularly for long-tail patterns. Our results also highlight HolmE’s effectiveness in extrapolating to unseen relations through composition and its state-of-the-art performance on benchmark datasets.

Data analytics including machine learning (ML) is essential to extract insights from production data in modern industries. However, industrial ML is affected by: the low transparency of ML towards non-ML experts; poor and non-unified descriptions of ML practices for reviewing or comprehension; ad-hoc fashion of ML solutions tailored to specific applications, which affects their re-usability. To address these challenges, we propose the concept and a system of executable knowledge graph (KG), which represent KGs that rely on semantic technologies to formally encode ML knowledge and solutions. These KGs can be translated to executable scripts in a reusable and modularised fashion. The demo attendees will use our system to modify, integrate and create executable KGs via a graphic user interface, which offer a user-friendly way to understand, configure, reuse, and create data analytics pipelines.

With the development of Industry 4.0 technology, modern industries such as Bosch's welding monitoring witnessed the rapid widespread of machine learning (ML) based data analytical applications, which in the case of welding monitoring has led to more efficient and accurate welding monitoring quality. However, industrial ML is affected by the low transparency of ML towards non-ML experts needs. The lack of understanding by domain experts of ML methods hampers the application of ML methods in industry and the reuse of developed ML pipelines, as ML methods are often developed in an ad hoc manner for specific problems. To address these challenges, we propose the concept and a system of executable Knowledge Graph (KG), which formally encode ML knowledge and solutions in KGs, which serve as common language between ML experts and non-ML experts, thus facilitate their communication and increase the transparency of ML methods. We evaluated our system extensively with an industrial use case at Bosch, showing promising results.

Automatic knowledge graph (KG) construction is widely used for e.g. data integration, question answering and semantic search. There are many approaches of automatic KG construction. Among which, an important approach is to map the raw data to a given domain KG schema, e.g., domain ontology or conceptual graph, and construct the entities and properties according to the domain KG schema. However, the existing approaches to construct KGs are not always efficient enough and the resulting KGs are not sufficiently application and user-friendly. The main challenge arises from the trade-off: the domain KG schema should be domain-generic and knowledge-oriented, to reflect the general domain knowledge rather than data particularities; while a KG schema should be data-oriented, to cover all data features. If the former is directly used for KG construction, this can cause issues like a high load of blank nodes, which are technical nodes in the KGs that represent unknown entities. To this end, we propose our ScheRe system in the demo, which relies on a schema reshaping algorithm and other two semantic modules for enhancing KG construction. The demo attendees will use ScheRe to reshape a domain KG schema to data specific KG schema, build KGs with industrial data, and experience more user-friendly querying.