J-STAGE トップ  >  資料トップ  > 書誌事項

人工知能学会論文誌
Vol. 26 (2011) No. 2 P 366-375

記事言語:

http://doi.org/10.1527/tjsai.26.366

原著論文

This paper presents a novel method for acquiring a set of query patterns that are able to retrieve documents containing important information about an entity. Given an existing Wikipedia category that should contain the entity, we first extract all entities that are the subjects of the articles in the category. From these articles, we extract triplets of the form (subject-entity, query pattern, concept) that are expected to be in the search results of the query patterns. We then select a small set of query patterns so that when formulating search queries with these patterns, the overall precision and coverage of the returned information from the Web are optimized. We model this optimization problem as a Weighted Maximum Satisfiability (Weighted Max-SAT) problem. Experimental results demonstrate that the proposed method outperformed the methods based on statistical measures such as frequency and point-wise mutual information (PMI) being widely used in relation extraction.

Copyright © 2011 JSAI (The Japanese Society for Artificial Intelligence)

記事ツール

この記事を共有