Difference between revisions of "Entity-Relationship Queries over Wikipedia"
(Links) |
(infobox) |
||
Line 1: | Line 1: | ||
+ | {{Infobox work | ||
+ | | title = Entity-Relationship Queries over Wikipedia | ||
+ | | date = 2010 | ||
+ | | authors = [[Xiaonan Li]]<br />[[Chengkai Li]]<br />[[Cong Yu]] | ||
+ | | doi = 10.1145/1871985.1871991 | ||
+ | | link = https://dl.acm.org/citation.cfm?doid=1871985.1871991 | ||
+ | }} | ||
'''Entity-Relationship Queries over Wikipedia''' - scientific work related to [[Wikipedia quality]] published in 2010, written by [[Xiaonan Li]], [[Chengkai Li]] and [[Cong Yu]]. | '''Entity-Relationship Queries over Wikipedia''' - scientific work related to [[Wikipedia quality]] published in 2010, written by [[Xiaonan Li]], [[Chengkai Li]] and [[Cong Yu]]. | ||
== Overview == | == Overview == | ||
Wikipedia is the largest user-generated knowledge base. Authors propose a structured query mechanism, entity-relationship query , for searching entities in [[Wikipedia]] corpus by their properties and inter-relationships. An entity-relationship query consists of arbitrary number of predicates on desired entities. The semantics of each predicate is specified with keywords. Entity-relationship query searches entities directly over text rather than pre-extracted structured data stores. This characteristic brings two benefits: (1) Query semantics can be intuitively expressed by keywords; (2) It avoids information loss that happens during extraction. Authors present a ranking framework for general entity-relationship queries and a position-based Bounded Cumulative Model for accurate ranking of query answers. Experiments on INEX benchmark queries and own crafted queries show the effectiveness and accuracy of ranking method. | Wikipedia is the largest user-generated knowledge base. Authors propose a structured query mechanism, entity-relationship query , for searching entities in [[Wikipedia]] corpus by their properties and inter-relationships. An entity-relationship query consists of arbitrary number of predicates on desired entities. The semantics of each predicate is specified with keywords. Entity-relationship query searches entities directly over text rather than pre-extracted structured data stores. This characteristic brings two benefits: (1) Query semantics can be intuitively expressed by keywords; (2) It avoids information loss that happens during extraction. Authors present a ranking framework for general entity-relationship queries and a position-based Bounded Cumulative Model for accurate ranking of query answers. Experiments on INEX benchmark queries and own crafted queries show the effectiveness and accuracy of ranking method. |
Revision as of 09:16, 19 April 2020
Authors | Xiaonan Li Chengkai Li Cong Yu |
---|---|
Publication date | 2010 |
DOI | 10.1145/1871985.1871991 |
Links | Original |
Entity-Relationship Queries over Wikipedia - scientific work related to Wikipedia quality published in 2010, written by Xiaonan Li, Chengkai Li and Cong Yu.
Overview
Wikipedia is the largest user-generated knowledge base. Authors propose a structured query mechanism, entity-relationship query , for searching entities in Wikipedia corpus by their properties and inter-relationships. An entity-relationship query consists of arbitrary number of predicates on desired entities. The semantics of each predicate is specified with keywords. Entity-relationship query searches entities directly over text rather than pre-extracted structured data stores. This characteristic brings two benefits: (1) Query semantics can be intuitively expressed by keywords; (2) It avoids information loss that happens during extraction. Authors present a ranking framework for general entity-relationship queries and a position-based Bounded Cumulative Model for accurate ranking of query answers. Experiments on INEX benchmark queries and own crafted queries show the effectiveness and accuracy of ranking method.