Fine-grained type inference in knowledge graphs via probabilistic and tensor factorization methods

11Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Knowledge Graphs (KGs) have been proven to be incredibly useful for enriching semantic Web search results and allowing queries with a well-defined result set. In recent years much attention has been given to the task of inferring missing facts based on existing facts in a KG. Approaches have also been proposed for inferring types of entities, however these are successful in common types such as'Person','Movie', or'Actor'. There is still a large gap, however, in the inference of fine-grained types which are highly important for exploring specific lists and collections within web search. Generally there are also relatively fewer observed instances of fine-grained types present to train in KGs, and this poses challenges for the development of effective approaches. In order to address the issue, this paper proposes a new approach to the fine-grained type inference problem. This new approach is explicitly modeled for leveraging domain knowledge and utilizing additional data outside KG, that improves performance in fine-grained type inference. Further improvements in efficiency are achieved by extending the model to probabilistic inference based on entity similarity and typed class classification. We conduct extensive experiments on type triple classification and entity prediction tasks on Freebase FB15K benchmark dataset. The experiment results show that the proposed model outperforms the state-of-the-art approaches for type inference in KG, and achieves high performance results in many-to-one relation in predicting tail for KG completion task.

References Powered by Scopus

Learning the parts of objects by non-negative matrix factorization

10962Citations
N/AReaders
Get full text

Tensor decompositions and applications

7671Citations
N/AReaders
Get full text

Freebase: A collaboratively created graph database for structuring human knowledge

4246Citations
N/AReaders
Get full text

Cited by Powered by Scopus

A comprehensive overview of knowledge graph completion

63Citations
N/AReaders
Get full text

Connecting Embeddings Based on Multiplex Relational Graph Attention Networks for Knowledge Graph Entity Typing

19Citations
N/AReaders
Get full text

Learning entity type structured embeddings with trustworthiness on noisy knowledge graphs

10Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Moniruzzaman, A. B. M., Tang, M., Nayak, R., & Balasubramaniam, T. (2019). Fine-grained type inference in knowledge graphs via probabilistic and tensor factorization methods. In The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019 (pp. 3093–3100). Association for Computing Machinery, Inc. https://doi.org/10.1145/3308558.3313597

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 12

71%

Researcher 3

18%

Professor / Associate Prof. 2

12%

Readers' Discipline

Tooltip

Computer Science 18

95%

Business, Management and Accounting 1

5%

Save time finding and organizing research with Mendeley

Sign up for free