{"id":73937,"updated":"2025-01-21T21:45:44.260739+00:00","links":{},"created":"2025-01-18T23:31:41.790053+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00073937","sets":["581:6276:6404"]},"path":["6404"],"owner":"11","recid":"73937","title":["エンティティペア間類似性を利用した潜在関係検索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-04-15"},"_buckets":{"deposit":"27671917-74a9-49e9-9ed4-d500d22a8a18"},"_deposit":{"id":"73937","pid":{"type":"depid","value":"73937","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"エンティティペア間類似性を利用した潜在関係検索","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"エンティティペア間類似性を利用した潜在関係検索"},{"subitem_title":"Exploiting Relational Similarity between Entity Pairs for Latent Relational Search","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2011-04-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/73937/files/IPSJ-JNL5204033.pdf"},"date":[{"dateType":"Available","dateValue":"2013-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5204033.pdf","filesize":[{"value":"339.4 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"836612e6-cfba-44d8-8113-0f68ef13d8e1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"グェントアンドゥク"},{"creatorName":"ボレガラダヌシカ"},{"creatorName":"石塚, 満"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nguyen, TuanDuc","creatorNameLang":"en"},{"creatorName":"Danushka, Bollegala","creatorNameLang":"en"},{"creatorName":"Mitsuru, Ishizuka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"エンティティ間の潜在的な関係を利用して検索を行う潜在関係検索は，新しいWeb検索のパラダイムとしての可能性を有する．潜在関係検索エンジンを利用すると，たとえばクエリ{(Japan, Mt. Fuji), (Germany, ?)}に対して，ドイツで最も高い山である“Zugspitze”を“?”の答えとして出力することができる．つまり潜在関係検索エンジンは，日本で最も高い山が富士山であるという関係を利用して，ドイツで最も高い山であるZugspitzeを答えとして出力する．このような潜在関係検索をWeb上で高速かつ高精度に行うためには，いくつかの課題を解決する必要があり，本稿ではそれらを解決する方法を示す．まず，高速な検索を行うために，エンティティペアをWebから発見，抽出する手法と，抽出されたエンティティペアへのインデックス構築手法を提案する．次に，我々の考案による関係類似度計算アルゴリズムを利用し，インデックスを用いる検索結果のランキングを行うことで，高精度な潜在関係検索エンジンを実現する．また本研究では評価実験として，提案システムと既存の関係検索システムとのWeb上での性能比較を行う．その結果，提案手法は高い精度と平均逆順位（MRR）を得ることができ，かつ高速にクエリを処理できることを確認している．この結果により，潜在関係検索エンジンが実用レベルで応用可能であることを示す．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Latent relational search could be a new search paradigm based on the implicitly stated relation between two entities. A latent relational search engine is expected to return the entity “Zugspitze” as an answer to the question mark (?) in the query {(Japan, Mt. Fuji), (Germany, ?)}, because Mt. Fuji is the highest mountain in Japan, whereas Zugspitze is the highest mountain in Germany. To perform latent relational search on the Web, one must overcome several challenges: discovering entity pairs to build an index for high speed retrieval, exploring and representing entity pairs' relation, and ranking the candidate answers according to the degree of relational similarity between the candidate entity pairs and the input pair. We propose a method for extracting entity pairs from a text corpus to build an index for a high speed latent relational search engine. We apply a state-of-the-art relational similarity measuring algorithm invented by us to correctly assess the degree of relational similarity between two entity pairs and 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.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1802","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1790","bibliographicIssueDates":{"bibliographicIssueDate":"2011-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"52"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}