Skip to main navigation Skip to search Skip to main content

NERank: Ranking Named Entities in Document Collections

  • East China Normal University

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

Abstract

While most of the entity ranking research focuses on Web corpora with user queries as input, little has been done to rank entities directly from documents. We propose a ranking algorithm NERank to address this issue. NERank employs a random walk process on a weighted tripartite graph mined from the document collection. We evaluate NERank over real-life document datasets and compare it with baselines. Experimental results show the effectiveness of our method.

Original languageEnglish
Title of host publicationWWW 2016 Companion - Proceedings of the 25th International Conference on World Wide Web
PublisherAssociation for Computing Machinery, Inc
Pages123-124
Number of pages2
ISBN (Electronic)9781450341448
DOIs
StatePublished - 11 Apr 2016
Event25th International Conference on World Wide Web, WWW 2016 - Montreal, Canada
Duration: 11 May 201615 May 2016

Publication series

NameWWW 2016 Companion - Proceedings of the 25th International Conference on World Wide Web

Conference

Conference25th International Conference on World Wide Web, WWW 2016
Country/TerritoryCanada
CityMontreal
Period11/05/1615/05/16

Keywords

  • entity ranking
  • random walk
  • tripartite graph

Fingerprint

Dive into the research topics of 'NERank: Ranking Named Entities in Document Collections'. Together they form a unique fingerprint.

Cite this