Using relational similarity between word pairs for latent relational search on the web

Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishizuka

研究成果: Conference contribution

18 被引用数 (Scopus)

抄録

Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as an answer to the question mark (?) in the query {(Japan, Tokyo), (France, ?)} because the relation between Japan and Tokyo is highly similar to that between France and Paris. We propose an approach for exploring and indexing word pairs to efficiently retrieve candidate answers for a latent relational search query. Representing relations between two words in a word pair by lexical patterns allows our search engine to achieve a high MRR and high precision for the top 1 ranked result. When evaluating with a Web corpus, the proposed method achieves an MRR of 0.963 and it retrieves correct answer in the top 1 for 95.0% of queries.

本文言語English
ホスト出版物のタイトルProceedings - 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010
ページ196-199
ページ数4
1
DOI
出版ステータスPublished - 2010
外部発表はい
イベント2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010 - Toronto, ON
継続期間: 2010 8月 312010 9月 3

Other

Other2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010
CityToronto, ON
Period10/8/3110/9/3

ASJC Scopus subject areas

  • 人工知能
  • コンピュータ ネットワークおよび通信
  • ソフトウェア

フィンガープリント

「Using relational similarity between word pairs for latent relational search on the web」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル