de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

EntityAuthority: Semantically Enriched Graph-Based Authority Propagation

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45559

Stoyanovich,  Julia
Databases and Information Systems, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44104

Bedathur,  Srikanta
Databases and Information Systems, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44119

Berberich,  Klaus
Databases and Information Systems, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Stoyanovich, J., Bedathur, S., Berberich, K., & Weikum, G. (2007). EntityAuthority: Semantically Enriched Graph-Based Authority Propagation. In Tenth International Workshop on the Web and Databases (WebDB 2007) (pp. 1-6). Orsay, France: INRIA Saclay.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1F0F-8
Abstract
This paper pursues the recently emerging paradigm of searching for entities that are embedded in Web pages. We utilize information extraction techniques to identify entity candidates in documents, map them onto entries in a richly structured ontology, and derive a generalized data graph that encompasses {W}eb pages, entities, and ontological concepts and relationships. We exploit this combination of pages and entities for a novel kind of search-result ranking, coined {E}ntity{A}uthority, in order to improve the quality of keyword queries that return either pages or entities. To this end, we utilize the mutual reinforcement between authoritative pages and important entities. This resembles the {HITS} method for Web-graph link analysis and recently proposed {O}bject{R}ank methods, but our approach operates on a much richer, typed graph structure with different kinds of nodes and also differs in the underlying mathematical definitions. Preliminary experiments with topic-specific slices of Wikipedia demonstrate the effectiveness of our approach on certain classes of queries.