日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

EntityAuthority: Semantically Enriched Graph-Based Authority Propagation

MPS-Authors
/persons/resource/persons45559

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

/persons/resource/persons44104

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

/persons/resource/persons44119

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

/persons/resource/persons45720

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

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

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.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-1F0F-8
要旨
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.