Relation representation and indexing method for a fast and high precision latent relational web search engine

Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishizuka

研究成果: Article

抜粋

Latent relational search is a new search paradigm based on the proportional analogy between two entity pairs. A latent relational search engine is expected to return the entity "Paris" as an answer to the question mark(?) in the query {(Japan, Tokyo),(France, ?)} because the relation between Japan and Tokyo is high lysimilarto that between France and Paris. We propose amethod for extracting entity pairs from a text corpus to buildan index for a high speed latent relational search engine. By representing there lation between two entities in an entity pair usinglexical patterns, the proposed latent relational search engine can precisely measure the relational similarity between two entity pairs and can therefore accurately rank the result list. We evaluate the system using a Web corpus and compare the performance with an existing relational search engine. The results show that the proposed method achieves high precision and MRR while requiring small query processing time. Inparticular, the proposed method achieves an MRR of 0.963 and it retrieves correct answer in the Top 1 result for 95% of queries.

元の言語English
ページ(範囲)307-312
ページ数6
ジャーナルTransactions of the Japanese Society for Artificial Intelligence
26
発行部数2
DOI
出版物ステータスPublished - 2011
外部発表Yes

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software

フィンガープリント Relation representation and indexing method for a fast and high precision latent relational web search engine' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用