The data set knowledge graph: Creating a linked open data source for data sets

The simplest and effective way to store human knowledge through centuries was using text. Along with the advancement of technology nowadays, the volume of text has grown to be larger and larger. To extract useful information from this amount of text becomes an exceptionally complex task. As an effort to solve that problem, in this paper, we present a pipeline to extract core knowledge from large quantity text using distributed computing. The components of our pipeline are systems that were known to yield good results. The outputs of our proposed system are stored in a knowledge graph. A knowledge graph is a graph for storing knowledge in the form of triples (head, relation, tail). Some of the existing knowledge graphs in the world are Google knowledge graph, YAGO, DBLP, or DBpedia. These knowledge graphs have one thing in common—they are in English. The English language is studied by many researchers in the world and it had become a rich-resource language (with many natural language processing tools and data set). Vietnamese, on the other hand, is a low-resource language. Therefore, we use cross-lingual transfer method to build a Vietnamese knowledge graph. Firstly, we collect data in form of text about Vietnam tourism, which was written mostly in Vietnamese, using Google search and Wikipedia. In the next step, we translate them into English with Google Translate and use English Natural Language Processing tools like Stanford Parser, Co-referencing, ClausIE, MinIE to extract useful triples from this text. Lastly, the triples are translated back to Vietnamese to build a Vietnam tourism knowledge graph. Since we are working with massive text, we develop a distributed algorithm to extract triples from sentences of massive text. This is a distributed version of MinIE, which was originally developed for a single machine model. In Apache Spark framework, we divide massive text into many smaller parts and move them to the worker nodes with distributed MinIE function. Spark distributed MinIE will extract the triples of sentences in the local text of this worker node in parallel. Finally, the result of worker nodes will be sent back to the master node for building the knowledge graph. We conduct experiments with the distributed MinIE on spark cluster to prove the outperformance of our proposed algorithm.

Scholarly knowledge graph is a knowledge graph that is used to represent knowledge contained in scientific publication documents. The information we can find in a scientific publication document is as follows: author, institution, name of journal/conference, and research topic. A knowledge graph that has been built is usually still not perfect. Some incomplete information may be found. To add the missing information, we can use knowledge graph completion, which is a method for finding missing or incorrect relationships to improve the quality of a knowledge graph. Knowledge graph completion can be carried out on a scholarly knowledge graph by adding new entities and relationships to produce further information in the scholarly knowledge graph. The data added to the scholarly knowledge graph are only other papers of first author entity, the research field of first author entity, and a description of the conference/journal entity. The result shows that the scholarly knowledge graph was completed by adding 81% correct data for other papers of first author entity, 80.3% correct data for the research field of first author entity, and 53.9% correct data for the description of the conference/journal.

With the technological development of entity extraction, relationship extraction, knowledge reasoning, and entity linking, the research on knowledge graph has been carried out in full swing in recent years. To better promote the development of knowledge graph, especially in the Chinese language and in the financial industry, we built a high-quality data set, named financial research report knowledge graph (FR2KG), and organized the automated construction of financial knowledge graph evaluation at the 2020 China Knowledge Graph and Semantic Computing Conference (CCKS2020). FR2KG consists of 17,799 entities, 26,798 relationship triples, and 1,328 attribute triples covering 10 entity types, 19 relationship types, and 6 attributes. Participants are required to develop a constructor that will automatically construct a financial knowledge graph based on the FR2KG. In addition, we summarized the technologies for automatically constructing knowledge graphs, and introduced the methods used by the winners and the results of this evaluation.

Drug discovery and development is a complex and costly process. Machine learning approaches are being investigated to help improve the effectiveness and speed of multiple stages of the drug discovery pipeline. Of these, those that use Knowledge Graphs (KG) have promise in many tasks, including drug repurposing, drug toxicity prediction and target gene-disease prioritization. In a drug discovery KG, crucial elements including genes, diseases and drugs are represented as entities, while relationships between them indicate an interaction. However, to construct high-quality KGs, suitable data are required. In this review, we detail publicly available sources suitable for use in constructing drug discovery focused KGs. We aim to help guide machine learning and KG practitioners who are interested in applying new techniques to the drug discovery field, but who may be unfamiliar with the relevant data sources. The datasets are selected via strict criteria, categorized according to the primary type of information contained within and are considered based upon what information could be extracted to build a KG. We then present a comparative analysis of existing public drug discovery KGs and an evaluation of selected motivating case studies from the literature. Additionally, we raise numerous and unique challenges and issues associated with the domain and its datasets, while also highlighting key future research directions. We hope this review will motivate KGs use in solving key and emerging questions in the drug discovery domain.

In order to effectively organize and manage the text knowledge of forest diseases, this paper proposes a knowledge graph construction method based on deep learning, which uses the knowledge graph to describe the complex relationship between entities in a structured form. Firstly, the general method of constructing forest disease knowledge graph is described. Secondly, the characteristics of forest disease text are analyzed, preprocessed and labeled. And the data set is constructed. Then, for the unstructured text in the data set, the innovative deep learning method of Bi-gated Recurrent Unit (BiGRU) and Conditional Random Field(CRF) model is used to identify the named entities of forest disease names and therapeutic agents. Experiments on forest disease attribute text corpus show that the precison is 93.15%, which can be effectively applied to the named entity recognition task of forest disease text. Finally, the extracted knowledge is stored in the neo4j map database to intuitively reflect the internal structure of the knowledge graph and realize the visualization and reasoning based on forest disease knowledge.

Collaborative filtering (CF) usually suffers from data sparsity and cold starts. Knowledge graphs (KGs) are widely used to improve recommendation performance. To verify that knowledge graphs can further alleviate the above problems, this paper proposes an end-to-end framework that uses attentive knowledge graph perceptual propagation for recommendations (AKGP). This framework uses a knowledge graph as a source of auxiliary information to extract user–item interaction information and build a sub-knowledge base. The fusion of structural and contextual information is used to construct fine-grained knowledge graphs via knowledge graph embedding methods and to generate initial embedding representations. Through multi-layer propagation, the structured information and historical preference information are embedded into a unified vector space, and the potential user–item vector representation is expanded. This article used a knowledge perception attention module to achieve feature representation, and finally, the model was optimized using the stratified sampling joint learning method. Compared with the baseline model using MovieLens-1M, Last-FM, Book-Crossing and other data sets, the experimental results demonstrate that the model outperforms state-of-the-art KG-based recommendation methods, and the shortcomings of the existing model are improved. The model was applied to product design data and historical maintenance records provided by an automotive parts manufacturing company. The predictions of the recommended system are matched to the product requirements and possible failure records. This helped reduce costs and increase productivity, helping the company to quickly determine the cause of failures and reduce unplanned downtime.

Neural Machine Translation for Semantic-Driven Q&A Systems in the Factory Planning

SummaryRDF knowledge graphs (KG) usually contain billions of labeled entities, and how to obtain the desired results efficiently on RDF KG for given SPARQL queries have attracted increasing attentions recently. However, it is difficult for users to write a complex SPARQL query without full knowledge of the underlying KG schema due to the “schema‐free” feature of RDF KG. In this paper, we study the problem of acquiring semantic approximate results for a simple SPARQL query instead of the complex expression. The basic idea behind is to use the real knowledge semantics to extend the query intention of given simplified SPARQL query, and then a semantic based greedy search over is designed to return top‐k similar results. To obtain the knowledge semantics efficiently, we define type similarity to reorganize the original KG as a corpus with semantic locality and then a context aware text embedding model is adopted to achieve the semantic vectors of existing knowledge. Afterwards, an approximate query method over RDF KG is designed to obtain top‐k similar results based on the knowledge semantics above. Extensive experiments over DBpedia dataset and QALD‐4 benchmark confirm our solution's superiority on both effectiveness and efficiency.

Knowledge Graphs (KGs) have shown to be very important for applications such\nas personal assistants, question-answering systems, and search engines.\nTherefore, it is crucial to ensure their high quality. However, KGs inevitably\ncontain errors, duplicates, and missing values, which may hinder their adoption\nand utility in business applications, as they are not curated, e.g.,\nlow-quality KGs produce low-quality applications that are built on top of them.\nIn this vision paper, we propose a practical knowledge graph curation framework\nfor improving the quality of KGs. First, we define a set of quality metrics for\nassessing the status of KGs, Second, we describe the verification and\nvalidation of KGs as cleaning tasks, Third, we present duplicate detection and\nknowledge fusion strategies for enriching KGs. Furthermore, we give insights\nand directions toward a better architecture for curating KGs.\n

Abstract. Natural disasters have a significant impact on the environment and economies of all countries around the world, and a large amount of multi-source heterogeneous geographic information data is generated every day. However, due to a lack of knowledge transformation capabilities, these nations continue to struggle with the issue of "a large amount of data and little knowledge". Therefore, it is of great significance how to extract geographic knowledge related to disasters from the vast data and construct a geographic knowledge graph integrating disaster information. Based on the theory related to knowledge extraction, this paper proposes a method to construct a natural disaster knowledge graph integrating geographic information. The core of this knowledge graph is to construct the association relationship between natural disaster concepts, research areas, and spatial data. The vocabulary and relationships associated with disaster concepts are primarily transformed by an existing word list of geographic narratives, which then provide rich semantic relationships of domain concepts for the entire knowledge graph. The research areas and spatial data types are mainly obtained through knowledge entity extraction and disambiguation methods. This disaster knowledge graph can support applications well such as natural disaster visualization and analysis, data recommendation systems, and intelligent Q&A systems, which can further improve the intelligence of natural disaster knowledge services and is expected to promote the sharing and reuse of domain knowledge graphs to a certain extent.

Graph convolutional neural networks have difficulties in model training takes a lot of time and lack of universality in meta-path design when processing knowledge graphs. To solve these issues, this paper proposes an efficient recommendation algorithm integrating knowledge graphs with graph convolutional networks(EKG-GCN). The algorithm is mainly based on the graph convolution algorithm. Firstly, the relationship between users and entities is standardized and scored, then a new neighborhood aggregation method is proposed. Some nodes in the knowledge graph are set as central nodes. A distance-influence function is set up according to the distance from other nodes to the central node, and the feature extraction of information in the knowledge graph is completed according to the distance-influence function. Finally, the knowledge graph features are used as an auxiliary to complete the recommendation task. In the experiment, three data sets were selected to compare with other advanced models, and it was found that the model is in an advantageous position in terms of training time and recommendation effect, and has a certain degree of universality.

The prosperous development of cognition and human-level intelligence have made the creation of large-scale domain knowledge graphs (KGs) a hot research field. Entity alignment (EA), which discovers entity pairs that represent the same real object in different KGs, is the key technology for building large scale knowledge graph. Existing EA methods rely mainly on the vector representation of the entity and ignoring the semantic features of an entity in a KG, result in poor alignment quality. To address this limitation, we propose a new EA framework based on knowledge embeddings (KEs) and type matching constraints. By embedding two KGs into a unified vector space, we combine the similarity of the entity vector and the degree of the entity type matching to perform more accurate cross-KG EA. The experimental results show that our proposed method has very good performance on both cross-KG and cross-language data sets. On the DBP-YG dataset, in terms of Hit@1, Hits@10, and MRR, our methods have an average increase of 27% over the baseline method MTransE. In most cases, our method significantly improves the accuracy of EA compared with state-of-the-art methods.

Most of the biomedical knowledge the research community has acquired during the past few decades has been deposited in scientific literature as unstructured text. Converting the unstructured text into the structured form will enable novel methodologies and applications for scientific discovery that can fully harness the power of the existing knowledge. To this end, two fundamental questions need to be addressed: named entity recognition (NER) and relation extraction (RE). NER deals with identifying the concepts or entities in texts, such as diseases, genes/proteins, chemical compounds, etc. while RE aims to extract the relations among these entities. Together, the extracted information forms a knowledge graph (KG) where the nodes are entities in the texts and the edges represent their relationships. KGs can link concepts within existing research to allow researchers to find connections that may have been difficult to discover without them. The LitCoin Natural Language Processing (NLP) Challenge was recently organized by NCATS of NIH and NASA to spur innovation by rewarding the most creative and high-impact uses of biomedical text to create KGs. Our team participated in the challenge and ranked first place. We have applied the methods we developed for the LitCoin NLP challenge to all PubMed abstracts and constructed the largest-scale biomedical KG to date. We show that powerful and versatile query functions can be implemented on top of the KG to enable highly specific and accurate knowledge retrieval and inference of causal and indirect relationships. Citation Format: Xin Sui, Yuan Zhang, Feng Pan, Donghu Sun, Menghan Chung, Jinfeng Zhang. Constructing the largest-scale knowledge graph using all PubMed abstracts and its application for highly specific and accurate knowledge retrieval. [abstract]. In: Proceedings of the American Association for Cancer Research Annual Meeting 2023; Part 1 (Regular and Invited Abstracts); 2023 Apr 14-19; Orlando, FL. Philadelphia (PA): AACR; Cancer Res 2023;83(7_Suppl):Abstract nr 5421.

Knowledge Graph Embedding (KGE) is a technique used to capture structural information from Knowledge Graphs (KGs), enabling various downstream applications such as recommender system. KGE models trained on integrated KGs from multiple organizations tend to outperform those trained on a single KG, owing to the greater richness and diversity of information. Therefore, Federated Knowledge Graph Embedding (FKGE) emerges as a promising approach for privacy-preserving training of KGE models on KGs across organizations (clients). Existing FKGE framework learns a uniform global KGE model that achieves global optima by minimizing aggregated loss across clients. However, heterogeneity among KGs often leads to divergent local optima. This presents a fundamental trade-off: ensuring global optima can compromise local performance, while focusing on local optima can decrease global model utility. To overcome this, we propose Federated Local Adaptive Knowledge Graph Embedding (FedAdap) by drawing inspiration from partial federated learning. FedAdap employs a multilayer convolutional neural network, wherein its lower layers are shared across clients to learn shared information, it maps a seed KGE model into an alignment vector space representation. Its upper layers remain private, transforming the alignment vector space representation to an adaptive KGE model tailored to the local KG. Through this, FedAdap allows clients to leverage shared information while maintaining local adaptability and mitigating the impact of KGs heterogeneity. Experiments on data sets FB15k-237 and NELL-995 show that FedAdap outperforms its counterparts in link prediction tasks.

For better understanding user information needs, Google proposed the Knowledge Graph as supplements to the results returned by its search engine. Many search engines have also developed their own knowledge graph services. However, although there are many freely accessible structured datasets, such as Freebase, developers have to build the knowledge graph from scratch without any support from open source initiatives. Recently, in our preliminary work, we were trying to develop an open source Java Script plug-in, namely FKG.js (Free Knowledge Graph), for HTML5-based applications to easily extend their potential knowledge graph modules. In the plug-in, we also provided a visualization solution using freely accessible structured datasets from the Internet. In addition, we managed to propose server-side APIs for collecting user behavior patterns in order to optimize the display of the knowledge graph.