@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00141162,
 book = {全国大会講演論文集},
 issue = {「情報爆発」時代に向けた新IT基盤技術},
 month = {Mar},
 note = {Traditional relation extraction requires pre-defined relations and many human annotated training data. Open relation extraction demands a set of heuristic rules to extract all potential relations from text. These requirements reduce the practicability and robustness of information extraction system. In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a ranked list of sentences containing target relation between entity pair. The proposed framework uses dual expansion model to incrementally discover relevant sentences. Then these extracted relation instances are ranked according their relevance to the given seeds. The proposed framework is tested with four frequently used relationships; the results show the effectiveness of relation expansion framework.},
 pages = {175--176},
 publisher = {情報処理学会},
 title = {Duality based Expansion for Relation of Entity Pair},
 volume = {第72回},
 year = {2010}
}