Cited by 65

The DOI matches its Crossref record.

A survey on knowledge graph-based recommender systems

ZHANG, Qi, ZHANG, Le, QIN, Chuan, WANG, Chao, ZHU, Hengshu, XIONG, Hui, CHEN, Enhong, GUO, Qingyu, ZHUANG, Fuzhen·2020·SCIENTIA SINICA Informationis

Abstract

Recommender system (RS) targets at providing accurate item recommendations to users with respect to their preferences; it has been widely employed in various online applications for addressing the problem of information explosion and improving user experience. In the past decades, while tremendous efforts have been made in enhancing the performance of RSs, some long-standing challenges, such as data sparsity, cold start, and result diversity, are unaddressed. Along this line, an emerging research trend is to exploit the rich semantic information contained in the knowledge graph (KG); it has been proven to be an effective way to enhance the capability of RSs. To this end, we provide a focused survey on KG-based RS via a holistic perspective of both technologies and applications. Specifically, firstly, we briefly review the core concepts and classical algorithms of the RSs and KGs. Secondly, we comprehensively introduce the representative and state-of-the-art works in this field based on different strategies of exploiting KGs for RSs. Meanwhile, we also summarize some typical application scenarios of KG-based RSs, for facilitating the hands-on practices of corresponding algorithms. Finally, we present our opinions on the prospects of KG-based RS and suggest some future research directions in this area.

Overview

Integrity signals

Registry

Crossref · 10.1360/ssi-2019-0274

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Many comprehensive survey papers exist for knowledge graphs generally and for domain-specific knowledge graphs such as smart grids, industrial products, manufacturing and production, biomedical domain, and recommendation engines.

    “In the literature, many comprehensive survey papers for knowledge graph [1], domain-specific knowledge graphs such as smart grids [2], industrial products [3], manufacturing and production [4] biomedical domain [5] and knowledge graphs with recommendation engines [6] exist”
  • No survey paper focuses on the concept of knowledge graphs in the scholarly domain.

    “In the literature, many comprehensive survey papers for knowledge graph [1], domain-specific knowledge graphs such as smart grids [2], industrial products [3], manufacturing and production [4] biomedical domain [5] and knowledge graphs with recommendation engines [6] exist, whereas no survey paper focuses on concept of knowledge graphs in scholarly domain.”

Citations

Cited by

Sorted by citations

Metadata

Authors
ZHANG, Q., ZHANG, L., QIN, C., WANG, C., ZHU, H., XIONG, H., CHEN, E., GUO, Q., & ZHUANG, F.
Venue
SCIENTIA SINICA Informationis
Published
2020-07-01
Volume
50
Issue
7
Pages
937-956
ISSN
1674-7267
Cited by
65
References
0
Language
en

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review