Named Entity Resolution in Personal Knowledge Graphs

Mayank Kejriwal
7/22/2023
cs.AIcs.DB

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Entity Resolution (ER) is the problem of determining when two entities refer to the same underlying entity. The problem has been studied for over 50 years, and most recently, has taken on new importance in an era of large, heterogeneous 'knowledge graphs' published on the Web and used widely in domains as wide ranging as social media, e-commerce and search. This chapter will discuss the specific problem of named ER in the context of personal knowledge graphs (PKGs). We begin with a formal definition of the problem, and the components necessary for doing high-quality and efficient ER. We also discuss some challenges that are expected to arise for Web-scale data. Next, we provide a brief literature review, with a special focus on how existing techniques can potentially apply to PKGs. We conclude the chapter by covering some applications, as well as promising directions for future research.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kejriwal2023named,
  title  = {Named Entity Resolution in Personal Knowledge Graphs},
  author = {Mayank Kejriwal},
  year   = {2023},
  eprint = {2307.12173},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.12173v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.12173.svg)](https://codeofpaper.com/paper/2307.12173)

Discussion