SYSTEM AND METHOD TO DISCOVER MEANINGFUL PATHS FROM LINKED OPEN DATA

摘要

A method, a system and a computer program product for searching a knowledge base and finding top-k meaningful paths for different concept pairs input by a user in linked open data utilizing the degree of association between concepts as the weight of the two concepts in a knowledge graph and to find the top-k shortest path as meaningful paths. A large corpus is used to train the association of different concept pairs. A deep learning based framework is used to learn a concept vector to represent the concept and the cosine similarity of the concept vector and an input concept vector indicating the degree of association of the vectors as the weight of these two concepts in the knowledge graph. The top-k meaningful paths are determined based on the weights and the shortest paths are provided for use by users as the meaningful paths.

主权项

1. A system for searching a knowledge base for finding top-k meaningful paths between concepts in linked open data in response to input concept pairs based on a user search request, comprising:
a data corpus containing concept pairs; a processing unit comprising:
a concept extraction module to search and extract concept and its context from said data corpus;a model generation module to generate a vector representation for each extracted concept;a concept vector model storage which stores a vector representation from said module generation module;a concept vector reader which stores vector representation of concept pairs from the concept vector module; a knowledge base; said processing unit further including:
an association calculator, using each concept vector representation from said concept vector reader and search results of the knowledge base in response to the input concept pairs, calculating an association score for each concept vector pair and assigning each score as the weight of a vector connecting the respective concept pair;storage for storing a knowledge base with associated weights, the weights being associated with each respective concept; anda top-k paths calculator for using the stored association score of each respective concept vector pair to generate top-k meaningful paths of an input concept pair input to the system.