NERank: Bringing order to named entities from texts

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Most entity ranking research aims to retrieve a ranked list of entities from a Web corpus given a query. However, entities in plain documents can be ranked directly based on their relative importance, in order to support entity-oriented Web applications. In this paper, we introduce an entity ranking algorithm NERank to address this issue. NERank first constructs a graph model called Topical Tripartite Graph from a document collection. A ranking function is designed to compute the prior ranks of topics based on three quality metrics. We further propose a meta-path constrained random walk method to propagate prior topic ranks to entities. We evaluate NERank over real-life datasets and compare it with baselines. Experimental results illustrate the effectiveness of our approach.

Original languageEnglish
Title of host publicationWeb Technologies and Applications - 18th Asia-Pacific Web Conference, APWeb 2016, Proceedings
EditorsGuanfeng Liu, Feifei Li, Kyuseok Shim, Kai Zheng
PublisherSpringer Verlag
Pages15-27
Number of pages13
ISBN (Print)9783319458137
DOIs
StatePublished - 2016
Event18th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2016 - Suzhou, China
Duration: 23 Sep 201625 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9931 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2016
Country/TerritoryChina
CitySuzhou
Period23/09/1625/09/16

Keywords

  • Entity ranking
  • Meta-path constrained random walk
  • Topic modeling
  • Topical tripartite graph

Fingerprint

Dive into the research topics of 'NERank: Bringing order to named entities from texts'. Together they form a unique fingerprint.

Cite this