Search

In an era marked by rapid globalisation and digitalisation, the realms of education and technology are increasingly intersecting, particularly within the sphere of environmental design education. This study ventures into the integration of internet technology with environmental design pedagogy, emphasizing the development of a cross-disciplinary curriculum and a nuanced evaluation of its educational impact. Traditional research methodologies predominantly focus on short-term outcomes, often neglecting the longitudinal growth and deeper experiences of learners. Addressing this oversight, our research introduces an innovative curriculum system founded on knowledge graph techniques, aiming to enrich the educational content. The application of knowledge graph technology in curriculum development is primarily manifested through the structured representation of course content, academic knowledge points, and their interconnections. By constructing knowledge graphs, educators are enabled to clearly identify the links and intersections between different academic fields, facilitating curriculum design that extends beyond the imparting of knowledge within singular disciplines to an integration of resources across subjects. This approach promotes the comprehensive application of knowledge and the cultivation of innovative capabilities. Alongside this, we employ a time series analysis for a more dynamic and detailed assessment of teaching effectiveness. This not only provides an academic benchmark but also charts a new course, offering actionable insights for educators in the field. Through this study, we aspire to bridge the gap between technology and environmental design education, ensuring a comprehensive and future-ready learning environment for students. In the context of environmental design education, the intrinsic connections between design principles, sustainability, and user experience are revealed through knowledge graphs. Within this framework, students are empowered to explore the application of these concepts in practical design projects. For instance, it becomes apparent that enhancing the user experience of a public space necessitates consideration of aesthetics, functionality, and environmental sustainability factors. Through this methodology, the use of knowledge graph technology not only enhances the coherence and systematic nature of course content but also fosters students' creative thinking and problem-solving abilities, further driving the integration and innovation of education. [ABSTRACT FROM AUTHOR]

The volume and complexity of lighting system are increasing, and the traditional fault diagnosis method can not meet the requirements. It is proposed to use the strong knowledge association and analysis ability of knowledge graph on big data to assist fault analysts in the lighting system fault diagnosis. Firstly, the schema layer of the knowledge graph in the top-down style was designed, which defined the overall architecture of the lighting system fault diagnosis knowledge graph. Then, the BERT-BiLSTM-CRF model was constructed and trained for knowledge extraction by using self-built data set, and the data layer of the knowledge graph in the bottom-up style was built. And then, the fault diagnosis rule module was constructed and optimized by combining the knowledge graph with the deduction lattice algorithm. Finally, the knowledge graph was visualized by using the Neo4j graph database and its application process in fault diagnosis was analyzed. The experimental results show that the BERT-BiLSTM-CRF model has a 17.58% improvement in precision over the BiLSTM-CRF model for the lighting data knowledge extraction task, and has better accuracy and effectiveness. This method effectively improves the reliability and intelligent level of fault diagnosis of lighting system. [ABSTRACT FROM AUTHOR]

This paper presents a survey on multilingual Knowledge Graph Question Answering (mKGQA). We employ a systematic review methodology to collect and analyze the research results in the field of mKGQA by defining scientific literature sources, selecting relevant publications, extracting objective information (e.g., problem, approach, evaluation values, used metrics, etc.), thoroughly analyzing the information, searching for novel insights, and methodically organizing them. Our insights are derived from 46 publications: 26 papers specifically focused on mKGQA systems, 14 papers concerning benchmarks and datasets, and 7 systematic survey articles. Starting its search from 2011, this work presents a comprehensive overview of the research field, encompassing the most recent findings pertaining to mKGQA and Large Language Models. We categorize the acquired information into a well-defined taxonomy, which classifies the methods employed in the development of mKGQA systems. Moreover, we formally define three pivotal characteristics of these methods, namely resource efficiency, multilinguality, and portability. These formal definitions serve as crucial reference points for selecting an appropriate method for mKGQA in a given use case. Lastly, we delve into the challenges of mKGQA, offer a broad outlook on the investigated research field, and outline important directions for future research. Accompanying this paper, we provide all the collected data, scripts, and documentation in an online appendix. [ABSTRACT FROM AUTHOR]

In the relational database realm, there has been a shift towards novel hybrid database architectures combining the properties of transaction processing (OLTP) and analytical processing (OLAP). OLTP workloads are made up by read and write operations on a small number of rows and are typically addressed by indexes such as B+trees. On the other side, OLAP workloads consists of big read operations that scan larger parts of the dataset. To address both workloads some databases introduced an architecture using a buffer or delta partition. Precisely, changes are accumulated in a write-optimized delta partition while the rest of the data is compressed in the read-optimized main partition. Periodically, the delta storage is merged in the main partition. In this paper we investigate for the first time how this architecture can be implemented and behaves for RDF graphs. We describe in detail the indexing-structures one can use for each partition, the merge process as well as the transactional management. We study the performances of our triple store, which we call qEndpoint , over two popular benchmarks, the Berlin SPARQL Benchmark (BSBM) and the recent Wikidata Benchmark (WDBench). We are also studying how it compares against other public Wikidata endpoints. This allows us to study the behavior of the triple store for different workloads, as well as the scalability over large RDF graphs. The results show that, compared to the baselines, our triple store allows for improved indexing times, better response time for some queries, higher insert and delete rates, and low disk and memory footprints, making it ideal to store and serve large Knowledge Graphs. [ABSTRACT FROM AUTHOR]

RDF and SPARQL provide a uniform way to publish and query billions of triples in open knowledge graphs (KGs) on the Web. Yet, provisioning of a fast, reliable, and responsive live querying solution for open KGs is still hardly possible through SPARQL endpoints alone: while such endpoints provide a remarkable performance for single queries, they typically can not cope with highly concurrent query workloads by multiple clients. To mitigate this, the Linked Data Fragments (LDF) framework sparked the design of different alternative low-cost interfaces such as Triple Pattern Fragments (TPF), that partially offload the query processing workload to the client side. On the downside, such interfaces still come with the expense of unnecessarily high network load due to the necessary transfer of intermediate results to the client, leading to query performance degradation compared with endpoints. To address this problem, in the present work, we investigate alternative interfaces, refining and extending the original TPF idea, which also aims at reducing server-resource consumption, by shipping query-relevant partitions of KGs from the server to the client. To this end, first, we align formal definitions and notations of the original LDF framework to uniformly present existing LDF implements and such "partition-based" LDF approaches. These novel LDF interfaces retrieve, instead of the exact triples matching a particular query pattern, a subset of pre-materialized, compressed, partitions of the original graph, containing all answers to a query pattern, to be further evaluated on the client side. As a concrete representative of partition-based LDF, we present smart-KG+, extending and refining our prior work (In WWW '20: The Web Conference 2020 (2020) 984–994 ACM / IW3C2) in several respects. Our proposed approach is a step forward towards a better-balanced share of the query processing load between clients and servers by shipping graph partitions driven by the structure of RDF graphs to group entities described with the same sets of properties and classes, resulting in significant data transfer reduction. Our experiments demonstrate that the smart-KG+ significantly outperforms existing Web SPARQL interfaces on both pre-existing benchmarks for highly concurrent query execution as well as an accustomed query workload inspired by query logs of existing SPARQL endpoints. [ABSTRACT FROM AUTHOR]

Debugging and repairing Web Ontology Language (OWL) ontologies has been a key field of research since OWL became a W3C recommendation. One way to understand errors and fix them is through explanations. These explanations are usually extracted from the reasoner and displayed to the ontology authors as is. In the meantime, there has been a recent call in the eXplainable AI (XAI) field to use expert knowledge in the form of knowledge graphs and ontologies. In this paper, a parallel between explanations for machine learning and for ontologies is drawn. This link enables the adaptation of XAI methods to explain ontologies and their entailments. Counterfactual explanations have been identified as a good candidate to solve the explainability problem in machine learning. The CEO (Counterfactual Explanations for Ontologies) method is thus proposed to explain inconsistent ontologies using counterfactual explanations. A preliminary user study is conducted to ensure that using XAI methods for ontologies is relevant and worth pursuing. [ABSTRACT FROM AUTHOR]

To implement Open Governance a crucial element is the efficient use of the big amounts of open data produced in the public domain. Public administration is a rich source of data and potentially new knowledge. It is a data intensive sector producing vast amounts of information encoded in government decisions and acts, published nowadays on the World Wide Web. The knowledge shared on the Web is mostly made available via semi-structured documents written in natural language. To exploit this knowledge, technologies such as Natural Language Processing, Information Extraction, Data mining and the Semantic Web could be used, embedding into documents explicit semantics based on formal knowledge representations such as ontologies. Knowledge representation can be made possible by the deployment of Knowledge Graphs, collections of interlinked representations of entities, events or concepts, based on underlying ontologies. This can assist data analysts to achieve a higher level of situational awareness, facilitating automated reasoning towards different objectives, such as for knowledge management, data maintenance, transparency and cybersecurity. This paper presents a new ontology d2kg [d(iavgeia) 2(to) k(nowledge) g(raph)] integrating in a unique way standard EU ontologies, core and controlled vocabularies to enable exploitation of publicly available data from government decisions and acts published on the Greek platform Diavgeia with the aim to facilitate data sharing, re-usability and interoperability. It demonstrates a characteristic example of a Knowledge Graph based representation of government decisions and acts, highlighting its added value to respond to real practical use cases for the promotion of transparency, accountability and public awareness. The developed d2kg ontology in owl is accessible at: http://w3id.org/d2kg , as well as documented at: http://w3id.org/d2kg/documentation. [ABSTRACT FROM AUTHOR]

The General Data Protection Regulation (GDPR) has imposed strict requirements for data sharing, one of which is informed consent. A common way to request consent online is via cookies. However, commonly, users accept online cookies being unaware of the meaning of the given consent and the following implications. Once consent is given, the cookie "disappears", and one forgets that consent was given in the first place. Retrieving cookies and consent logs becomes challenging, as most information is stored in the specific Internet browser's logs. To make users aware of the data sharing implied by cookie consent and to support transparency and traceability within systems, we present a knowledge graph (KG) based tool for personalised cookie consent information visualisation. The KG is based on the OntoCookie ontology, which models cookies in a machine-readable format and supports data interpretability across domains. Evaluation results confirm that the users' comprehension of the data shared through cookies is vague and insufficient. Furthermore, our work has resulted in an increase of 47.5% in the users' willingness to be cautious when viewing cookie banners before giving consent. These and other evaluation results confirm that our cookie data visualisation approach and tool help to increase users' awareness of cookies and data sharing. [ABSTRACT FROM AUTHOR]

There are two main limitations in most of the existing Knowledge Graph Question Answering (KGQA) algorithms. First, the approaches depend heavily on the structure and cannot be easily adapted to other KGs. Second, the availability and amount of additional domain-specific data in structured or unstructured formats has also proven to be critical in many of these systems. Such dependencies limit the applicability of KGQA systems and make their adoption difficult. A novel algorithm is proposed, MuHeQA, that alleviates both limitations by retrieving the answer from textual content automatically generated from KGs instead of queries over them. This new approach (1) works on one or several KGs simultaneously, (2) does not require training data what makes it is domain-independent, (3) enables the combination of knowledge graphs with unstructured information sources to build the answer, and (4) reduces the dependency on the underlying schema since it does not navigate through structured content but only reads property values. MuHeQA extracts answers from textual summaries created by combining information related to the question from multiple knowledge bases, be them structured or not. Experiments over Wikidata and DBpedia show that our approach achieves comparable performance to other approaches in single-fact questions while being domain and KG independent. Results raise important questions for future work about how the textual content that can be created from knowledge graphs enables answer extraction. [ABSTRACT FROM AUTHOR]

While there has been a trend in the last decades for publishing large-scale and highly-interconnected Knowledge Graphs (KGs), their users often get overwhelmed by the task of understanding their content as a result of their size and complexity. Data profiling approaches have been proposed to summarize large KGs into concise and meaningful representations, so that they can be better explored, processed, and managed. Profiles based on schema patterns represent each triple in a KG with its schema-level counterpart, thus covering the entire KG with profiles of considerable size. In this paper, we provide empirical evidence that profiles based on schema patterns, if explored with suitable mechanisms, can be useful to help users understand the content of big and complex KGs. ABSTAT provides concise pattern-based profiles and comes with faceted interfaces for profile exploration. Using this tool we present a user study based on query completion tasks. We demonstrate that users who look at ABSTAT profiles formulate their queries better and faster than users browsing the ontology of the KGs. The latter is a pretty strong baseline considering that many KGs do not even come with a specific ontology to be explored by the users. To the best of our knowledge, this is the first attempt to investigate the impact of profiling techniques on tasks related to knowledge graph understanding with a user study. [ABSTRACT FROM AUTHOR]

Semantic rule mining can be used for both deriving task-agnostic or task-specific information within a Knowledge Graph (KG). Underlying logical inferences to summarise the KG or fully interpretable binary classifiers predicting future events are common results of such a rule mining process. The current methods to perform task-agnostic or task-specific semantic rule mining operate, however, a completely different KG representation, making them less suitable to perform both tasks or incorporate each other's optimizations. This also results in the need to master multiple techniques for both exploring and mining rules within KGs, as well losing time and resources when converting one KG format into another. In this paper, we use INK, a KG representation based on neighbourhood nodes of interest to mine rules for improved decision support. By selecting one or two sets of nodes of interest, the rule miner created on top of the INK representation will either mine task-agnostic or task-specific rules. In both subfields, the INK miner is competitive to the currently state-of-the-art semantic rule miners on 14 different benchmark datasets within multiple domains. [ABSTRACT FROM AUTHOR]

Exploring the potential of neuro-symbolic hybrid approaches offers promising avenues for seamless high-level understanding and reasoning about visual scenes. Scene Graph Generation (SGG) is a symbolic image representation approach based on deep neural networks (DNN) that involves predicting objects, their attributes, and pairwise visual relationships in images to create scene graphs, which are utilized in downstream visual reasoning. The crowdsourced training datasets used in SGG are highly imbalanced, which results in biased SGG results. The vast number of possible triplets makes it challenging to collect sufficient training samples for every visual concept or relationship. To address these challenges, we propose augmenting the typical data-driven SGG approach with common sense knowledge to enhance the expressiveness and autonomy of visual understanding and reasoning. We present a loosely-coupled neuro-symbolic visual understanding and reasoning framework that employs a DNN-based pipeline for object detection and multi-modal pairwise relationship prediction for scene graph generation and leverages common sense knowledge in heterogenous knowledge graphs to enrich scene graphs for improved downstream reasoning. A comprehensive evaluation is performed on multiple standard datasets, including Visual Genome and Microsoft COCO, in which the proposed approach outperformed the state-of-the-art SGG methods in terms of relationship recall scores, i.e. Recall@K and mean Recall@K, as well as the state-of-the-art scene graph-based image captioning methods in terms of SPICE and CIDEr scores with comparable BLEU, ROGUE and METEOR scores. As a result of enrichment, the qualitative results showed improved expressiveness of scene graphs, resulting in more intuitive and meaningful caption generation using scene graphs. Our results validate the effectiveness of enriching scene graphs with common sense knowledge using heterogeneous knowledge graphs. This work provides a baseline for future research in knowledge-enhanced visual understanding and reasoning. The source code is available at https://github.com/jaleedkhan/neusire. [ABSTRACT FROM AUTHOR]

The editorial discusses the challenges of achieving agricultural sustainability in the face of finite resources and ecological balance. It emphasizes the need for a Global Food Systems Datahub to integrate vast datasets for informed decision-making in agriculture. The Datahub, powered by a knowledge graph, aims to transform sustainable intensification practices and bridge the gap between individual landowners and policymakers. The article highlights various research efforts focusing on standardized vocabulary, semantic modeling, and data sharing in the context of global food systems. [Extracted from the article]

Computational agents support humans in many areas of life and are therefore found in heterogeneous contexts. This means that agents operate in rapidly changing environments and can be confronted with huge state and action spaces. In order to perform services and carry out activities satisfactorily, i.e. in a goal-oriented manner, agents require prior knowledge and therefore have to develop and pursue context-dependent policies. The problem here is that prescribing policies in advance is limited and inflexible, especially in dynamically changing environments. Moreover, the context (i.e. the external and internal state) of an agent determines its choice of actions. Since the environments in which agents operate can be stochastic and complex in terms of the number of states and feasible actions, activities are usually modelled in a simplified way by Markov decision processes so that, for example, agents with reinforcement learning are able to learn policies, i.e. state-action pairs, that help to capture the context and act accordingly to optimally perform activities. However, training policies for all possible contexts using reinforcement learning is time-consuming. A requirement and challenge for agents is to learn strategies quickly and respond immediately in cross-context environments and applications, e.g., the Internet, service robotics, cyber-physical systems. In this work, we propose a novel simulation-based approach that enables a) the representation of heterogeneous contexts through knowledge graphs and entity embeddings and b) the context-aware composition of policies on demand by ensembles of agents running in parallel. The evaluation we conducted with the "Virtual Home" dataset indicates that agents with a need to switch seamlessly between different contexts, e.g. in a home environment, can request on-demand composed policies that lead to the successful completion of context-appropriate activities without having to learn these policies in lengthy training steps and episodes, in contrast to agents that use reinforcement learning. The presented approach enables both context-aware and cross-context applicability of untrained computational agents. Furthermore, the source code of the approach as well as the generated data, i.e. the trained embeddings and the semantic representation of domestic activities, is open source and openly accessible on Github and Figshare. [ABSTRACT FROM AUTHOR]

Deep learning models have achieved impressive performance in various tasks, but they are usually opaque with regards to their inner complex operation, obfuscating the reasons for which they make decisions. This opacity raises ethical and legal concerns regarding the real-life use of such models, especially in critical domains such as in medicine, and has led to the emergence of the eXplainable Artificial Intelligence (XAI) field of research, which aims to make the operation of opaque AI systems more comprehensible to humans. The problem of explaining a black-box classifier is often approached by feeding it data and observing its behaviour. In this work, we feed the classifier with data that are part of a knowledge graph, and describe the behaviour with rules that are expressed in the terminology of the knowledge graph, that is understandable by humans. We first theoretically investigate the problem to provide guarantees for the extracted rules and then we investigate the relation of "explanation rules for a specific class" with "semantic queries collecting from the knowledge graph the instances classified by the black-box classifier to this specific class". Thus we approach the problem of extracting explanation rules as a semantic query reverse engineering problem. We develop algorithms for solving this inverse problem as a heuristic search in the space of semantic queries and we evaluate the proposed algorithms on four simulated use-cases and discuss the results. [ABSTRACT FROM AUTHOR]

Artificial intelligence systems are not simply built on a single dataset or trained model. Instead, they are made by complex data science workflows involving multiple datasets, models, preparation scripts, and algorithms. Given this complexity, in order to understand these AI systems, we need to provide explanations of their functioning at higher levels of abstraction. To tackle this problem, we focus on the extraction and representation of data journeys from these workflows. A data journey is a multi-layered semantic representation of data processing activity linked to data science code and assets. We propose an ontology to capture the essential elements of a data journey and an approach to extract such data journeys. Using a corpus of Python notebooks from Kaggle, we show that we are able to capture high-level semantic data flow that is more compact than using the code structure itself. Furthermore, we show that introducing an intermediate knowledge graph representation outperforms models that rely only on the code itself. Finally, we report on a user survey to reflect on the challenges and opportunities presented by computational data journeys for explainable AI. [ABSTRACT FROM AUTHOR]

Neuro-Symbolic Artificial Intelligence (AI) focuses on integrating symbolic and sub-symbolic systems to enhance the performance and explainability of predictive models. Symbolic and sub-symbolic approaches differ fundamentally in how they represent data and make use of data features to reach conclusions. Neuro-symbolic systems have recently received significant attention in the scientific community. However, despite efforts in neural-symbolic integration, symbolic processing can still be better exploited, mainly when these hybrid approaches are defined on top of knowledge graphs. This work is built on the statement that knowledge graphs can naturally represent the convergence between data and their contextual meaning (i.e., knowledge). We propose a hybrid system that resorts to symbolic reasoning, expressed as a deductive database, to augment the contextual meaning of entities in a knowledge graph, thus, improving the performance of link prediction implemented using knowledge graph embedding (KGE) models. An entity context is defined as the ego network of the entity in a knowledge graph. Given a link prediction task, the proposed approach deduces new RDF triples in the ego networks of the entities corresponding to the heads and tails of the prediction task on the knowledge graph (KG). Since knowledge graphs may be incomplete and sparse, the facts deduced by the symbolic system not only reduce sparsity but also make explicit meaningful relations among the entities that compose an entity ego network. As a proof of concept, our approach is applied over a KG for lung cancer to predict treatment effectiveness. The empirical results put the deduction power of deductive databases into perspective. They indicate that making explicit deduced relationships in the ego networks empowers all the studied KGE models to generate more accurate links. [ABSTRACT FROM AUTHOR]

Biomedical data analysis and visualization often demand data experts for each unique health event. There is a clear lack of automatic tools for semantic visualization of the spread of health risks through biomedical data. Illnesses such as coronavirus disease (COVID-19) and Monkeypox spread rampantly around the world before governments could make decisions based on the analysis of such data. We propose the design of a knowledge graph (KG) for spatio-temporal tracking of public health event propagation. To achieve this, we propose the specialization of the Core Propagation Phenomenon Ontology (PropaPhen) into a health-related propagation phenomenon domain ontology. Data from the UMLS and Open Street Maps are suggested for instantiating the proposed knowledge graph. Finally, the results of a use case on COVID-19 data from the World Health Organization are analyzed to evaluate the possibilities of our approach. [ABSTRACT FROM AUTHOR]

Real-world data (RWD) (i.e., data from Electronic Healthcare Records – EHRs, ePrescription systems, patient registries, etc.) gain increasing attention as they could support observational studies on a large scale. OHDSI is one of the most prominent initiatives regarding the harmonization of RWD and the development of relevant tools via the use of a common data model, OMOP-CDM. OMOP-CDM is a crucial step towards syntactic and semantic data interoperability. Still, OMOPCDM is based on a typical relational database format, and thus, the vision of a fully connected semantically enriched model is not fully realized. This work presents an open-source effort to map the OMOP-CDM model and the data it hosts, to an ontological model using RDF to support the FAIRness of RWD and their interlinking with Linked Open Data (LOD) towards the vision of the Semantic Web. [ABSTRACT FROM AUTHOR]

Health literacy empowers people to access, understand and apply health information to effectively manage their own health and to be an active participant in healthcare decisions. In this paper we propose a conceptual model for cognitive factors affecting health literacy and related socioeconomic aspects. Then we develop the HEALIE Knowledge Graph to represent the model, drawing from various medical ontologies, resources, and insights from domain experts. Finally, we combine the Knowledge Graph with a Large Language Model to generate personalised medical content and showcase the results through an example. [ABSTRACT FROM AUTHOR]

Robust estimation of concept similarity is crucial for applications of AI in the commercial, biomedical, and publishing domains, among others. While the related task of word similarity has been extensively studied, resulting in a wide range of methods, estimating concept similarity between nodes in Wikidata has not been considered so far. In light of the adoption of Wikidata for increasingly complex tasks that rely on similarity, and its unique size, breadth, and crowdsourcing nature, we propose that conceptual similarity should be revisited for the case of Wikidata. In this paper, we study a wide range of representative similarity methods for Wikidata, organized into three categories, and leverage background information for knowledge injection via retrofitting. We measure the impact of retrofitting with different weighted subsets from Wikidata and ProBase. Experiments on three benchmarks show that the best performance is achieved by pairing language models with rich information, whereas the impact of injecting knowledge is most positive on methods that originally do not consider comprehensive information. The performance of retrofitting is conditioned on the selection of high-quality similarity knowledge. A key limitation of this study, similar to prior work lies in the limited size and scope of the similarity benchmarks. While Wikidata provides an unprecedented possibility for a representative evaluation of concept similarity, effectively doing so remains a key challenge. [ABSTRACT FROM AUTHOR]

Differential privacy is a framework that provides formal tools to develop algorithms to access databases and answer statistical queries with quantifiable accuracy and privacy guarantees. The notions of differential privacy are defined independently of the data model and the query language at steak. Most differential privacy results have been obtained on aggregation queries such as counting or finding maximum or average values, and on grouping queries over aggregations such as the creation of histograms. So far, the data model used by the framework research has typically been the relational model and the query language SQL. However, effective realizations of differential privacy for SQL queries that required joins had been limited. This has imposed severe restrictions on applying differential privacy in RDF knowledge graphs and SPARQL queries. By the simple nature of RDF data, most useful queries accessing RDF graphs will require intensive use of joins. Recently, new differential privacy techniques have been developed that can be applied to many types of joins in SQL with reasonable results. This opened the question of whether these new results carry over to RDF and SPARQL. In this paper we provide a positive answer to this question by presenting an algorithm that can answer counting queries over a large class of SPARQL queries that guarantees differential privacy, if the RDF graph is accompanied with semantic information about its structure. We have implemented our algorithm and conducted several experiments, showing the feasibility of our approach for large graph databases. Our aim has been to present an approach that can be used as a stepping stone towards extensions and other realizations of differential privacy for SPARQL and RDF. [ABSTRACT FROM AUTHOR]

Knowledge graph embeddings represent a group of machine learning techniques which project entities and relations of a knowledge graph to continuous vector spaces. RDF2vec is a scalable embedding approach rooted in the combination of random walks with a language model. It has been successfully used in various applications. Recently, multiple variants to the RDF2vec approach have been proposed, introducing variations both on the walk generation and on the language modeling side. The combination of those different approaches has lead to an increasing family of RDF2vec variants. In this paper, we evaluate a total of twelve RDF2vec variants on a comprehensive set of benchmark models, and compare them to seven existing knowledge graph embedding methods from the family of link prediction approaches. Besides the established GEval benchmark introducing various downstream machine learning tasks on the DBpedia knowledge graph, we also use the new DLCC (Description Logic Class Constructors) benchmark consisting of two gold standards, one based on DBpedia, and one based on synthetically generated graphs. The latter allows for analyzing which ontological patterns in a knowledge graph can actually be learned by different embedding. With this evaluation, we observe that certain tailored RDF2vec variants can lead to improved performance on different downstream tasks, given the nature of the underlying problem, and that they, in particular, have a different behavior in modeling similarity and relatedness. The findings can be used to provide guidance in selecting a particular RDF2vec method for a given task. [ABSTRACT FROM AUTHOR]

Virtual data integration is the current approach to go for data wrangling in data-driven decision-making. In this paper, we focus on automating schema integration, which extracts a homogenised representation of the data source schemata and integrates them into a global schema to enable virtual data integration. Schema integration requires a set of well-known constructs: the data source schemata and wrappers, a global integrated schema and the mappings between them. Based on them, virtual data integration systems enable fast and on-demand data exploration via query rewriting. Unfortunately, the generation of such constructs is currently performed in a largely manual manner, hindering its feasibility in real scenarios. This becomes aggravated when dealing with heterogeneous and evolving data sources. To overcome these issues, we propose a fully-fledged semi-automatic and incremental approach grounded on knowledge graphs to generate the required schema integration constructs in four main steps: bootstrapping, schema matching, schema integration, and generation of system-specific constructs. We also present Nextia DI , a tool implementing our approach. Finally, a comprehensive evaluation is presented to scrutinize our approach. [ABSTRACT FROM AUTHOR]

Knowledge graph reasoning (KGR) aims to infer new knowledge or detect noises, which is essential for improving the quality of knowledge graphs. Recently, various KGR techniques, such as symbolic- and embedding-based methods, have been proposed and shown strong reasoning ability. Symbolic-based reasoning methods infer missing triples according to predefined rules or ontologies. Although rules and axioms have proven effective, it is difficult to obtain them. Embedding-based reasoning methods represent entities and relations as vectors, and complete KGs via vector computation. However, they mainly rely on structural information and ignore implicit axiom information not predefined in KGs but can be reflected in data. That is, each correct triple is also a logically consistent triple and satisfies all axioms. In this paper, we propose a novel NeuRal Axiom Network (NeuRAN) framework that combines explicit structural and implicit axiom information without introducing additional ontologies. Specifically, the framework consists of a KG embedding module that preserves the semantics of triples and five axiom modules that encode five kinds of implicit axioms. These axioms correspond to five typical object property expression axioms defined in OWL2, including ObjectPropertyDomain, ObjectPropertyRange, DisjointObjectProperties, IrreflexiveObjectProperty and AsymmetricObjectProperty. The KG embedding module and axiom modules compute the scores that the triple conforms to the semantics and the corresponding axioms, respectively. Compared with KG embedding models and CKRL, our method achieves comparable performance on noise detection and triple classification and achieves significant performance on link prediction. Compared with TransE and TransH, our method improves the link prediction performance on the Hits@1 metric by 22.0% and 20.8% on WN18RR-10% dataset, respectively. [ABSTRACT FROM AUTHOR]

The W3C linked building data group is working on modeling the information for integrating building information with building life cycle data using Semantic Web technologies. The community has proposed a set of semantic models such as ifcOWL and Building Topology Ontology (BOT), to model various applications across Architecture, Engineering, Construction, and Operation (AECO) domain. On the other hand, the Semantic Web of Things (SWoT) group proposed standard semantic models such as M3-lite and BOSH ontologies for describing the sensor networks, observations, and sensor measurements. Both the aforementioned domains have their own siloed applications and with the evolution of the smart home domain, there is a need to combine the knowledge of building information with the sensor knowledge to develop cross-domain applications. However, in order to develop such downstream applications leveraging advantages from both domains requires interoperable knowledge. This paper proposes an interoperable ontology, Building Topology Ontology for Smart Homes (BOTSH), with the aim of aligning the building domain with sensors domain semantic models. The BOTSH ontology facilitates capturing knowledge from both domains and helps in developing cross-domain applications. The potential of the proposed model was demonstrated using a real-life building model based on the competency questions framed by the domain experts. [ABSTRACT FROM AUTHOR]

Existing POI recommendation methods often fail to capture the fine-grained preferences of users and face the challenge of modeling multiple relationships. Moreover, knowledge graph-based recommendation methods are limited in storing dynamic user trajectories, making them unsuitable for POI recommendation scenarios. In this paper, we propose a Multi-View Heterogeneous Knowledge learning model that utilizes techniques for heterogeneous knowledge representation learning and multi-view context modeling. Our model comprehensively models user preferences and the relationships between users and POIs by utilizing information from users' visiting sequences and POI attributes knowledge graph. Specifically, we design a heterogeneous knowledge embedding method to learn the representation of users and POIs using POI attribute knowledge and users' visiting sequences. Additionally, we constructed a user trajectory similarity graph and a POI attribute similarity graph to explore potential relations between users and between POIs. The former measures the similarity of user behaviors based on user visit sequences, and the latter quantifies the similarity between different POIs through a novel feature mapping method. Finally, we propose a multi-view hybrid learning method that combines unsupervised and supervised learning paradigms to model complex relationships, improving the overall recommendation performance. Extensive experiments on real-world datasets validate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Along with the booming of intelligent manufacturing, the reliability management of intelligent manufacturing systems appears to be becoming more significant. Failure mode and effects analysis (FMEA) is a prospective reliability management instrument extensively utilized to manage failure modes of systems, products, processes, and services in various industries. However, the conventional FMEA method has been criticized for its inherent limitations. Machine learning can handle large amounts of data and has merits in reliability analysis and prediction, which can help in failure mode classification and risk management under limited resources. Therefore, this paper devises a method for complex systems based on an improved FMEA model combined with machine learning and applies it to the reliability management of intelligent manufacturing systems. First, the structured network of failure modes is constructed based on the knowledge graph for intelligent manufacturing systems. Then, the grey relation analysis (GRA) is applied to determine the risk prioritization of failure modes. Hereafter, the k-means algorithm in unsupervised machine learning is employed to cluster failure modes into priority classes. Finally, a case study and further comparative analysis are implemented. The results demonstrate that failure modes in system security, production quality, and information integration are high-risk and require more resources for prevention. In addition, recommendations for risk prevention and monitoring of intelligent manufacturing systems were given based on the clustering results. In comparison to the conventional FMEA method, the proposed method can more precisely capture the coupling relationship between the failure modes compared with. This research provides significant support for the reliability and risk management of complex systems such as intelligent manufacturing systems. [ABSTRACT FROM AUTHOR]

In addressing the challenges of scattered data and limited professional knowledge in traditional power data quality assessment and verification governance, our approach leveraged natural language processing (NLP) technology for text preprocessing, incorporating power system research findings and case analyses. Named entity recognition enhanced entity identification accuracy, while relationship weighting technology facilitated entity classification and relationship weight assignment. The resulting power system knowledge graph was seamlessly integrated into a graph database for real-time updates. Through the synergistic use of relationship weighting technology and graph convolutional networks (GCN), our method achieved precise representation and modeling of power system knowledge graphs. The research outcomes underscored the method's exceptional performance in real-time anomaly detection, maintaining an anomaly detection rate between 1% and 10% and accuracy fluctuating from 80% to 98%. This method stands as a testament to its efficacy in processing power data and validating its robustness in power system assessment and verification. [ABSTRACT FROM AUTHOR]

The document discusses the emergence of neuro-symbolic AI as a promising paradigm that combines subsymbolic and symbolic AI methods for mutual benefit. It addresses the limitations of neural and symbolic AI methods when applied in isolation and highlights the potential of neuro-symbolic AI in advancing machine intelligence. The special issue attracted 6 submissions covering areas such as knowledge graph representation, link prediction, natural language processing, and computer vision, showcasing the development of neuro-symbolic AI approaches in various domains. The papers in the special issue demonstrate the effectiveness of combining neural and symbolic techniques for tasks like rule mining, link prediction, concept embeddings, and visual understanding and reasoning. [Extracted from the article]

Conversational recommender systems use natural language conversations to elicit user preferences and recommend items proactively. Existing methods based on graph neural networks have been proven to be effective in exploiting knowledge graphs. However, node positions are often treated as constants, which leads to the neglect of graph connectivity due to fuzzy processing. In addition, although the transformer has significant advantages in understanding the text, its secondary computational complexity may be incapable when dealing with long texts. In order to solve these problems, we propose an additive positional conversational recommender model called APCR. This model converts the pair product of transformer into a linear operation, and uses the Laplacian eigenvector to build a location graph. The extended graph neural network captures the topology structure of the location knowledge graph. Specifically, we design an encoder based on additive attention to break through the bottleneck of long text. Furthermore, we develop a recommendation model based on a positional graph neural network to match items with dialogue context, thereby capturing the graph topology. Extensive experiments on the REDIAL dataset show significant improvements in our proposed model over the state-of-the-art methods in recommendation and dialogue generation evaluations. [ABSTRACT FROM AUTHOR]

Industry 4.0 (I4.0) is a new era in the industrial revolution that emphasizes machine connectivity, automation, and data analytics. The I4.0 pillars such as autonomous robots, cloud computing, horizontal and vertical system integration, and the industrial internet of things have increased the performance and efficiency of production lines in the manufacturing industry. Over the past years, efforts have been made to propose semantic models to represent the manufacturing domain knowledge, one such model is Reference Generalized Ontological Model (RGOM).1 https://w3id.org/rgom However, its adaptability like other models is not ensured due to the lack of manufacturing data. In this paper, we aim to develop a benchmark dataset for knowledge graph generation in Industry 4.0 production lines and to show the benefits of using ontologies and semantic annotations of data to showcase how the I4.0 industry can benefit from KGs and semantic datasets. This work is the result of collaboration with the production line managers, supervisors, and engineers in the football industry to acquire realistic production line data2 https://github.com/MuhammadYahta/ManufacturingProductionLineDataSetGeneration-Football ,.3 https://zenodo.org/record/7779522 Knowledge Graphs (KGs) or Knowledge Graph (KG) have emerged as a significant technology to store the semantics of the domain entities. KGs have been used in a variety of industries, including banking, the automobile industry, oil and gas, pharmaceutical and health care, publishing, media, etc. The data is mapped and populated to the RGOM classes and relationships using an automated solution based on JenaAPI, producing an I4.0 KG. It contains more than 2.5 million axioms and about 1 million instances. This KG enables us to demonstrate the adaptability and usefulness of the RGOM. Our research helps the production line staff to take timely decisions by exploiting the information embedded in the KG. In relation to this, the RGOM adaptability is demonstrated with the help of a use case scenario to discover required information such as current temperature at a particular time, the status of the motor, tools deployed on the machine, etc. [ABSTRACT FROM AUTHOR]

This work describes the application of semantic web standards to data quality governance of data production pipelines in the architectural, engineering, and construction (AEC) domain for Ordnance Survey Ireland (OSi). It illustrates a new approach to data quality governance based on establishing a unified knowledge graph for data quality measurements across a complex, heterogeneous, quality-centric data production pipeline. It provides the first comprehensive formal mappings between semantic models of data quality dimensions defined by the four International Organization for Standardization (ISO) and World Wide Web Consortium (W3C) data quality standards applied by different tools and stakeholders. It provides an approach to uplift rule-based data quality reports into quality metrics suitable for aggregation and end-to-end analysis. Current industrial practice tends towards stove-piped, vendor-specific and domain-dependent tools to process data quality observations however there is a lack of open techniques and methodologies for combining quality measurements derived from different data quality standards to provide end-to-end data quality reporting, root cause analysis or visualisation. This work demonstrated that it is effective to use a knowledge graph and semantic web standards to unify distributed data quality monitoring in an organisation and present the results in an end-to-end data dashboard in a data quality standards-agnostic fashion for the Ordnance Survey Ireland data publishing pipeline. [ABSTRACT FROM AUTHOR]

Entity linking is an important task for information retrieval and knowledge graph construction. Most existing methods use a bi-encoder structure to encode mentions and entities in the same space, and learn contextual features for entity linking. However, this type of system still faces some problems: (1) the entity embedding part of the model only learns from the local context of the target entity, which is too unique for entity linking model to learn the context commonality of information; (2) the entity disambiguation part only uses similarity calculation once to determine the target entity, resulting in insufficient interaction between the mentions and candidate entities, and ineffective recall of real entities. We propose a new entity linking model based on graph neural network. Different from other bi-encoder retrieval systems, this paper introduces a fine-grained semantic enhancement information into the entity embedding part of the bi-encoder to reduce the specificity of the model. Then, the cross-attention encoder is used to re-rank the target mention and each candidate entity after the entity retrieval model. Experimental results show that although the model is not optimal in inference speed, it outperforms all baseline methods on the AIDA-CoNLL dataset, and has good generalization effects on four datasets in different fields such as MSNBC and ACE2004. [ABSTRACT FROM AUTHOR]

Stance detection for user reviews on social platforms aims to classify the stance of users' reviews toward a specific topic. Existing studies focused on the internal semantic features of reviews' texts, but ignored the external knowledge associated with the review. This paper retrieves external knowledge related to the key information of each review by mapping it to a knowledge graph. Thereafter, this paper infuses the external knowledge into deep learning model for stance detection. Considering that infusing external knowledge may bring noise to the model, this paper adopts the personalized PageRank method to filter the introduced irrelevant external knowledge. Infusing external knowledge can improve the classification performance by providing background knowledge. In addition to considering the textual features of reviews when constructing the stance detection model, this paper employs a gated graph neural network (GGNN) approach to fuse the structural information between reviews to capture the interactions of reviews. The experiments show that the model improves 1.5% –6.9% in macro-average scores compared to six benchmark models in this paper. By combining the textual features and structural information of reviews and introducing external knowledge, the model effectively improves the stance detection performance. [ABSTRACT FROM AUTHOR]

Weighted knowledge bases for description logics with typicality provide a logical interpretation of MultiLayer Perceptrons, based on a "concept-wise" multi-preferential semantics. On the one hand, in the finitely many-valued case, Answer Set Programming (ASP) has been shown to be suitable for addressing defeasible reasoning from weighted knowledge bases for the boolean fragment of ALC. On the other hand, the semantics of weighted knowledge bases with typicality, in their different variants, have suggested some new gradual argumentation semantics, as well as an approach for defeasible reasoning over a weighted argumentation graph, building on the gradual semantics and, specifically on the φ-coherent semantics. In this paper, we explore the relationships between weighted knowledge bases and weighted argumentation graphs, to develop proof methods for defeasible reasoning over an argumentation graph under the φ-coherent semantics, in the finitely-valued case. We establish a mapping from a weighted argumentation graph to a weighted knowledge base as well as a lower bound on the complexity of the problem of verifying graded implications over an argumentation graph in the φ-coherent semantics. We also consider a mapping from weighted knowledge bases to weighted argumentation graphs, and provide an ASP implementation and some experimental results. [ABSTRACT FROM AUTHOR]

Creative influence is responsible for a considerable part of the creative process of an artist and can largely be associated with their social circle. It has been observed that the type and amount of relationships with other fellow artists correlates with the success of an artist. Most of the recent literature has focused on using artefact similarity as a proxy for creative influence between two artists. However, this approach neglects the significance of an artist's social network. In this work, we rely on an ontology that comprehensively model the relationship between individuals as a Knowledge Graph and we design an explainable method based on graph theory to predict the influences of an artist given their social network. We evaluate our method on a dataset of relationships between Jazz musicians and achieve accurate results when compared to baselines that rely on the distribution of the data. Our results are aligned with relevant works from the socio-cognitive and psychology fields. We show that our method generalises to resources where information on influence is not directly available and can be used to enrich existing Knowledge Graphs. The code and the ontology developed is shared at under CC-BY license. [ABSTRACT FROM AUTHOR]

Entity alignment is the task of identifying entities from different knowledge graphs (KGs) that point to the same item and is important for KG fusion. In the real world, due to the heterogeneity between different KGs, equivalent entities often have different relations around them, so it is difficult for Graph Convolutional Network (GCN) to accurately learn the relation information in the KGs. Moreover, to solve the problem regarding inadequate utilisation of relation information in entity alignment, a novel GCN-based model, joint Unsupervised Relation Alignment for Entity Alignment (URAEA), is proposed. The model first employs a novel method for calculating relation embeddings by using entity embeddings, then constructs unsupervised seed relation alignments through these relation embeddings, and finally performs entity alignment together with relation alignment. In addition, the seed entity alignments are expanded based on the generated seed relation alignments. Experiments conducted on three real-world datasets show that this approach outperforms state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Attempts to express information from various documents in graph form are rapidly increasing. The speed and volume in which these documents are being generated call for an automated process, based on machine learning techniques, for cost-effective and timely analysis. Past studies responded to such needs by building knowledge graphs or technology trees from the bibliographic information of documents, or by relying on text mining techniques in order to extract keywords and/or phrases. While these approaches provide an intuitive glance into the technological hotspots or the key features of the select field, there still is room for improvement, especially in terms of recognizing the same entities appearing in different forms so as to interconnect closely related technological concepts properly. In this paper, we propose to build a patent knowledge network using the United States Patent and Trademark Office (USPTO) patent filings for the semiconductor device sector by fine-tuning Huggingface's named entity recognition (NER) model with our novel edge weight updating neural network. For the named entity normalization, we employ edge weight updating neural network with positive and negative candidates that are chosen by substring matching techniques. Experiment results show that our proposed approach performs very competitively against the conventional keyword extraction models frequently employed in patent analysis, especially for the named entity normalization (NEN) and document retrieval tasks. By grouping entities with named entity normalization model, the resulting knowledge graph achieves higher scores in retrieval tasks. We also show that our model is robust to the out-of-vocabulary problem by employing the fine-tuned BERT NER model. [ABSTRACT FROM AUTHOR]

Sequential recommendation aims to predict users' future activities based on their historical interaction sequences. Various neural network architectures, such as Recurrent Neural Networks (RNN), Graph Neural Networks (GNN), and self-attention mechanisms, have been employed in the tasks, exploring multiple aspects of user preferences, including general interests, short-term interests, long-term interests, and item co-occurrence patterns. Despite achieving good performance, there are still limitations in capturing complex user preferences. Specifically, the current structures of RNN, GNN, etc., only capture item-level transition relations while neglecting attribute-level transition relations. Additionally, the explicit item relations are studied using item co-occurrence modules, but they cannot capture the implicit item-item relations. To address these issues, we propose a knowledge-augmented Gated Recurrent Unit (GRU) to improve the short-term user interest module and adopt a collaborative item aggregation method to enhance the item co-occurrence module. Additionally, our long-term interest module utilizes a bitwise gating mechanism to select historical item features significant to users' current preferences. We extensively evaluate our model on three real-world datasets alongside competitive methods, demonstrating its effectiveness in top K sequential recommendation. [ABSTRACT FROM AUTHOR]

Knowledge graph embedding (KGE) is typically used for link prediction to automatically predict missing links in knowledge graphs. Current KGE models are mainly based on complicated mathematical associations, which are highly expressive but ignore the uniformity behind the classical bilinear translational model TransE, a model that embeds all entities of knowledge graphs in a uniform space, enabling accurate embeddings. This study analyses the uniformity of TransE and proposes a novel KGE model called ConvUs that follows uniformity with expressiveness. Based on the convolution neural network (CNN), ConvUs proposes constraints on convolution filter values and employs a multi-layer, multi-scale CNN architecture with a non-parametric L2 norm-based scoring function for the calculation of triple scores. This addresses potential uniformity-related issues in existing CNN-based KGE models, allowing ConvUs to maintain a uniform embedding space while benefiting from the powerful expressiveness of CNNs. Furthermore, circular convolution is applied to alleviate the potential orderliness contradictions, making ConvUs more suitable for conducting uniform space KGE. Our model outperformed the base model ConvKB and several baselines on the link prediction benchmark WN18RR and FB15k-237, demonstrating strong applicability and generalization and indicating that the uniformity of embedding space with high expressiveness enables more efficient knowledge graph embeddings. [ABSTRACT FROM AUTHOR]

Conversational recommender systems provide users with item recommendations via interactive dialogues. Existing methods using graph neural networks have been proven to be an adequate representation of the learning framework for knowledge graphs. However, the knowledge graph involved in the dialogue context is vast and noisy, especially the noise graph nodes, which restrict the primary node's aggregation to neighbor nodes. In addition, although the recurrent neural network can encode the local structure of word sequences in a dialogue context, it may still be challenging to remember long-term dependencies. To tackle these problems, we propose a sparse multi-hop conversational recommender model named SMCR, which accurately identifies important edges through matching items, thus reducing the computational complexity of sparse graphs. Specifically, we design a multi-hop attention network to encode dialogue context, which can quickly encode the long dialogue sequences to capture the long-term dependencies. Furthermore, we utilize a variational auto-encoder to learn topic information for capturing syntactic dependencies. Extensive experiments on the travel dialogue dataset show significant improvements in our proposed model over the state-of-the-art methods in evaluating recommendation and dialogue generation. [ABSTRACT FROM AUTHOR]

With the continuous expansion of the power grid, the forms of faults are becoming increasingly complex, with a wide range of impacts and long maintenance cycles, posing increasingly severe challenges for power grid operators. In the current power system (PS), due to system limitations, there is a large amount of data, and the current computing system is limited by hardware and computing power, making it difficult to satisfy the requirements of real-time computing, comprehensive analysis, and expansion. This paper analyzed the technical basis of the knowledge graph (KG) of power grid operation and maintenance (O&M), and clarified the key role of model driving in the current large-scale smart grid (SG), which can effectively improve the efficiency and reliability of data processing in the SG. This paper also analyzed the model-driven PG O&M KG platform, and analyzed the role of particle swarm optimization (PSO) algorithm in PG operation and fault maintenance. After applying the PSO algorithm in this article, in the experimental results section, the fault rate of Transformer 5 was 2.1% lower than that of Transformer 4. The knowledge mapping model of grid O&M and the particle swarm algorithm in this paper can significantly reduce the failure rate of the grid, which has wide extension value. [ABSTRACT FROM AUTHOR]

Building and publishing knowledge graphs (KG) as Linked Data, either on the Web or in private companies, has become a relevant and crucial process in many domains. This process requires that users perform a wide number of tasks conforming to the life cycle of a KG, and these tasks usually involve different unrelated research topics, such as RDF materialisation or link discovery. There is already a large corpus of tools and methods designed to perform these tasks; however, the lack of one tool that gathers them all leads practitioners to develop ad-hoc pipelines that are not generic and, thus, non-reusable. As a result, building and publishing a KG is becoming a complex and resource-consuming process. In this paper, a generic framework called Helio is presented. The framework aims to cover a set of requirements elicited from the KG life cycle and provide a tool capable of performing the different tasks required to build and publish KGs. As a result, Helio aims at providing users with the means for reducing the effort required to perform this process and, also, Helio aims to prevent the development of ad-hoc pipelines. Furthermore, the Helio framework has been applied in many different contexts, from European projects to research work. [ABSTRACT FROM AUTHOR]

Knowledge Graphs are currently created using an assortment of techniques and tools: ad hoc code in a programming language, database export scripts, OpenRefine transformations, mapping languages, etc. Focusing on the latter, the wide variety of use cases, data peculiarities, and potential uses has had a substantial impact in how mappings have been created, extended, and applied. As a result, a large number of languages and their associated tools have been created. In this paper, we present the Conceptual Mapping ontology, that is designed to represent the features and characteristics of existing declarative mapping languages to construct Knowledge Graphs. This ontology is built upon the requirements extracted from experts experience, a thorough analysis of the features and capabilities of current mapping languages presented as a comparative framework; and the languages' limitations discussed by the community and denoted as Mapping Challenges. The ontology is evaluated to ensure that it meets these requirements and has no inconsistencies, pitfalls or modelling errors, and is publicly available online along with its documentation and related resources. [ABSTRACT FROM AUTHOR]

Knowledge graphs are often constructed from heterogeneous data sources, using declarative rules that map them to a target ontology and materializing them into RDF. When these data sources are large, the materialization of the entire knowledge graph may be computationally expensive and not suitable for those cases where a rapid materialization is required. In this work, we propose an approach to overcome this limitation, based on the novel concept of mapping partitions. Mapping partitions are defined as groups of mapping rules that generate disjoint subsets of the knowledge graph. Each of these groups can be processed separately, reducing the total amount of memory and execution time required by the materialization process. We have included this optimization in our materialization engine Morph-KGC, and we have evaluated it over three different benchmarks. Our experimental results show that, compared with state-of-the-art techniques, the use of mapping partitions in Morph-KGC presents the following advantages: (i) it decreases significantly the time required for materialization, (ii) it reduces the maximum peak of memory used, and (iii) it scales to data sizes that other engines are not capable of processing currently. [ABSTRACT FROM AUTHOR]

News consumption has shifted over time from traditional media to online platforms, which use recommendation algorithms to help users navigate through the large incoming streams of daily news by suggesting relevant articles based on their preferences and reading behavior. In comparison to domains such as movies or e-commerce, where recommender systems have proved highly successful, the characteristics of the news domain (e.g., high frequency of articles appearing and becoming outdated, greater dynamics of user interest, less explicit relations between articles, and lack of explicit user feedback) pose additional challenges for the recommendation models. While some of these can be overcome by conventional recommendation techniques, injecting external knowledge into news recommender systems has been proposed in order to enhance recommendations by capturing information and patterns not contained in the text and metadata of articles, and hence, tackle shortcomings of traditional models. This survey provides a comprehensive review of knowledge-aware news recommender systems. We propose a taxonomy that divides the models into three categories: neural methods, non-neural entity-centric methods, and non-neural path-based methods. Moreover, the underlying recommendation algorithms, as well as their evaluations are analyzed. Lastly, open issues in the domain of knowledge-aware news recommendations are identified and potential research directions are proposed. [ABSTRACT FROM AUTHOR]

Knowledge Graphs (KGs) comprise of interlinked information in the form of entities and relations between them in a particular domain and provide the backbone for many applications. However, the KGs are often incomplete as the links between the entities are missing. Link Prediction is the task of predicting these missing links in a KG based on the existing links. Recent years have witnessed many studies on link prediction using KG embeddings which is one of the mainstream tasks in KG completion. To do so, most of the existing methods learn the latent representation of the entities and relations whereas only a few of them consider contextual information as well as the textual descriptions of the entities. This paper introduces an attentive encoder-decoder based link prediction approach considering both structural information of the KG and the textual entity descriptions. Random walk based path selection method is used to encapsulate the contextual information of an entity in a KG. The model explores a bidirectional Gated Recurrent Unit (GRU) based encoder-decoder to learn the representation of the paths whereas SBERT is used to generate the representation of the entity descriptions. The proposed approach outperforms most of the state-of-the-art models and achieves comparable results with the rest when evaluated with FB15K, FB15K-237, WN18, WN18RR, and YAGO3-10 datasets. [ABSTRACT FROM AUTHOR]

People will increasingly get expedited and diverse means of accessing news as societies progress. Furthermore, there is a noticeable increase in the prevalence of incorrect and misleading information. Our research is motivated by the significant concerns regarding the detrimental impacts of disinformation on the general public, political stability, and trust in the media. The scarcity of Vietnamese-language datasets can be attributed to the predominant focus of false news detection studies on datasets only in English. Detection investigations of fake news have predominantly relied on supervised machine learning algorithms, which possess notable limitations when confronted with unclassified news articles that are either authentic or untrue. The utilization of Knowledge Graphs (KG) and Graph Convolutional Networks (GCN) holds promise in addressing the constraints of supervised machine learning algorithms. To address these problems, we propose an approach that integrates KG)into the procedure for detecting fake news. We utilize the Vietnamese Fake News Detection dataset (VFND-vietnamese-fake-news), comprising authentic and deceptive news articles from reputable Vietnamese newspapers such as vnexpress, tuoitre, and have been collected from 2018 to 2023. News articles are only labeled as real or fake after experiencing independent verification. The Glove embedding (Global Vectors for Word Representation) is employed to establish a knowledge network for the given dataset. This knowledge graph's construction is accomplished using the Word Mover's Distance (WMD) algorithm in conjunction with the K-nearest neighbor approach; GCN approach and the input KG train models to discern between real and fake news. With labeling half of the input dataset, the experimental findings indicate a notable level of accuracy, reaching up to 85%. Our research holds significant importance in identifying fake news, particularly within the context of the Vietnamese language. [ABSTRACT FROM AUTHOR]

Knowledge graphs are knowledge bases that represent entities and relations in the objective world through graph structure, and they have a boosting effect on many artificial intelligence tasks. To facilitate the development of downstream artificial intelligence tasks, knowledge graph embedding (KGE) is proposed. It aims to express semantic information for each entity and relation in the knowledge graph within a low-dimensional space. However, when it comes to semantic hierarchy, multiple relation patterns and multi-fold relational structures in knowledge graphs, most of the existing models tend to focus on only one or two aspects, often neglecting the importance of considering all three simultaneously. Therefore, we propose a new knowledge graph embedding model, Hierarchical relation and Entity Rotation-based Multi-Feature knowledge graph Embedding (HERotMFE). Concerning hierarchical relation rotation and entity rotation, it can represent semantic hierarchy, multiple relation patterns and multi-fold relations simultaneously. Self-attention mechanism is used to learn the weights of the two-part rotation to further enhance the model's performance. According to the findings of the experiments, HERotMFE outperforms existing models on most metrics and achieves state-of-the-art results. [ABSTRACT FROM AUTHOR]