Optimizing model parameter for entity summarization across knowledge graphs

Jihong Yan, Chen Xu, Na Li, Ming Gao () and Aoying Zhou
Additional contact information
Jihong Yan: Shanghai Polytechnic University
Chen Xu: Shanghai Agricultural Committee
Na Li: East China Normal University
Ming Gao: East China Normal University
Aoying Zhou: East China Normal University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 1, No 16, 293-318

Abstract: Abstract Knowledge graphs, which belongs to the category of semantic networks, are considered as a new method of knowledge representation of health care data. It establishes a semantic explanation model for human perception and health care information processing. Each knowledge graph is composed of massive entities and relationships. However, it is an arduous work to search and visualize users’ interested entities and attributes since there are many attributes for an entity across different knowledge graphs. It is a natural problem how to summarize an entity based on multiple knowledge graphs. We propose a three-stage algorithm to solve the problem of entity summarization across knowledge graphs, including candidate generation, knowledge graph linkage, and entity summarization. We propose an unsupervised framework to link different knowledge graphs based on the semantic and structure information of entities. To further reduce the computational cost, we employ word embedding technique to find the similar entities in semantic, and filter some pairs of unmatched entities. Finally, we model entity summarization as personalized ranking problem in a knowledge graph. We conduct a set of experiments to evaluate our proposed method on four real datasets: historical data for user query, two English knowledge graphs (YAGO and DBpeida) and an English corpus. Experimental results demonstrate the effectiveness of our proposed method by comparing with baselines.

Keywords: Entity summarization; Word embedding; Expectation maximization (EM) algorithm; Parameter optimization (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0225-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0225-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0225-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().