Semantic Networks

In this paper, we focus on the classification of books using short descriptive texts (cover blurbs) and additional metadata. Building upon BERT, a deep neural language model, we demonstrate how to combine text representations with metadata and knowledge graph embeddings, which encode author information. Compared to the standard BERT approach we achieve considerably better results for the classification task. For a more coarse-grained classification using eight labels we achieve an F1- score of 87.20, while a detailed classification using 343 labels yields an F1-score of 64.70. We make the source code and trained models of our experiments publicly available.

In April 2019 our partner Schneider Electric launched EcoStruxure Workplace Advisor, a smart building application aiming to increase the efficiency of managed office facilities. In this posting I want to outline the general architecture of this application which is based on Trinity RDF: our enterprise .NET API which enables developers without RDF experience to build knowledge graph applications. For anyone interested in increasing the productivity and flexibility of knowledge graph development teams I would like to advertise my talk on Tuesday where I will share more details about the case. The industry use case I will be presenting is Schneider Electric's EcoStruxure Workplace Advisor. Using this service one can derive actionable insights about a building through intuitive dashboards that analyse and integrate data from numerable IoT sensors and systems.

Knowledge graphs have attracted lots of attention in academic and industrial environments. Despite their usefulness, popular knowledge graphs suffer from incompleteness of information, especially in their type assertions. This has encouraged research in the automatic discovery of entity types. In this context, multiple works were developed to utilize logical inference on ontologies and statistical machine learning methods to learn type assertion in knowledge graphs. However, these approaches suffer from limited performance on noisy data, limited scalability and the dependence on labeled training samples. In this work, we propose a new unsupervised approach that learns to categorize entities into a hierarchy of named groups. We show that our approach is able to effectively learn entity groups using a scalable procedure in noisy and sparse datasets. We experiment our approach on a set of popular knowledge graph benchmarking datasets, and we publish a collection of the outcome group hierarchies.

Last week in the first installment of our five-part blog series on AI and graph technology, we gave an overview of four ways graphs add context for artificial intelligence: context for decisions with knowledge graphs, context for efficiency with graph accelerated ML, context for accuracy with connected feature extraction, and context for credibility with AI explainability. This week, we examine knowledge graphs, which provide context for decision support (e.g., for call center staff or support engineers) and help ensure that answers are appropriate to the situation (e.g., autonomous vehicles in rainy driving conditions). This will give you insight into how a graph technology platform like Neo4j enhances AI with knowledge graphs. Knowledge Graphs: Context for Decisions One of the AI areas that's moved into production fastest is decision support. Let's say we're trying to solve a real-world problem: making a decision that requires a human to have the right contextual, relevant information and trying to automate or streamline that process in some way.

Informing professionals about the latest research results in their field is a particularly important task in the field of health care, since any development in this field directly improves the health status of the patients. Meanwhile, social media is an infrastructure that allows public instant sharing of information, thus it has recently become popular in medical applications. In this study, we apply Multi Distance Knowledge Graph Embeddings (MDE) to link physicians and surgeons to the latest medical breakthroughs that are shared as the research results on Twitter. Our study shows that using this method physicians can be informed about the new findings in their field given that they have an account dedicated to their profession. Keywords: Knowledge Graph Embeddings · Social Media · Social Good · Health care · Twitter · Machine Learning 1 Introduction Twitter is a projection of the interactions of a society connected to the internet, which is in constant evolution.

Videolectures.net is planning to present the TheyBuyforYou project in video lectures format. Initially you are kindly invited to read about its first results. We are happy to announce the first release of the knowledge graph for public procurement, integrating tender and company data. Public procurement affects organisations across all sectors. With tenders amounting to close to 2 trillion euros annually in the EU, it is critical that this market operates fairly and efficiently, supporting competitiveness and accountability.

This paper studies aligning knowledge graphs from different sources or languages. Most existing methods train supervised methods for the alignment, which usually require a large number of aligned knowledge triplets. However, such a large number of aligned knowledge triplets may not be available or are expensive to obtain in many domains. Therefore, in this paper we propose to study aligning knowledge graphs in fully-unsupervised or weakly-supervised fashion, i.e., without or with only a few aligned triplets. We propose an unsupervised framework to align the entity and relation embddings of different knowledge graphs with an adversarial learning framework. Moreover, a regularization term which maximizes the mutual information between the embeddings of different knowledge graphs is used to mitigate the problem of mode collapse when learning the alignment functions. Such a framework can be further seamlessly integrated with existing supervised methods by utilizing a limited number of aligned triples as guidance. Experimental results on multiple datasets prove the effectiveness of our proposed approach in both the unsupervised and the weakly-supervised settings.

The unprecedented explosion in the amount of information we are generating and collecting, thanks to the arrival of the internet and the always-online society, powers all the incredible advances we see today in the field of artificial intelligence (AI) and Big Data. With this in mind, a great deal of thought and research has gone into working out the best way to store and organize information during the digital age. The relational database model was developed in the 1970s and organizes data into tables consisting of rows and columns – meaning the relationship between different data points can be determined at a glance. This worked very well in the early days of business computing, where information volumes grew slowly. For more complicated operations, however – such as establishing a relationship between data points stored in many different tables - the necessary operations quickly become complex, slow and cumbersome.

The unprecedented explosion in the amount of information we are generating and collecting, thanks to the arrival of the internet and the always-online society, powers all the incredible advances we see today in the field of artificial intelligence (AI) and Big Data. With this in mind, a great deal of thought and research has gone into working out the best way to store and organize information during the digital age. The relational database model was developed in the 1970s and organizes data into tables consisting of rows and columns – meaning the relationship between different data points can be determined at a glance. This worked very well in the early days of business computing, where information volumes grew slowly. For more complicated operations, however – such as establishing a relationship between data points stored in many different tables - the necessary operations quickly become complex, slow and cumbersome.

Conditions are essential in the statements of biological literature. Without the conditions (e.g., environment, equipment) that were precisely specified, the facts (e.g., observations) in the statements may no longer be valid. One biological statement has one or multiple fact(s) and/or condition(s). Their subject and object can be either a concept or a concept's attribute. Existing information extraction methods do not consider the role of condition in the biological statement nor the role of attribute in the subject/object. In this work, we design a new tag schema and propose a deep sequence tagging framework to structure conditional statement into fact and condition tuples from biological text. Experiments demonstrate that our method yields a information-lossless structure of the literature.