{"links":{},"id":31753,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031753","sets":["1164:2592:2607:2612"]},"path":["2612"],"owner":"1","recid":"31753","title":["属性付きグラフマッチングアルゴリズムの効率的な実装"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-03-17"},"_buckets":{"deposit":"8c44038d-9779-4935-84a1-bbcaff2e15b0"},"_deposit":{"id":"31753","pid":{"type":"depid","value":"31753","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"属性付きグラフマッチングアルゴリズムの効率的な実装","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"属性付きグラフマッチングアルゴリズムの効率的な実装"},{"subitem_title":"An Efficient Implementation of Attribute-Graph Matching Algorithm","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2006-03-17","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学"},{"subitem_text_value":"電気通信大学"},{"subitem_text_value":"電気通信大学"},{"subitem_text_value":"電気通信大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"University of Electro-Communications","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/31753/files/IPSJ-AL06105008.pdf"},"date":[{"dateType":"Available","dateValue":"2008-03-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL06105008.pdf","filesize":[{"value":"363.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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"8b308ce0-72f9-4087-949e-80c0702bf691","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"森田, 昭広"},{"creatorName":"古賀, 久志"},{"creatorName":"渡辺, 俊典"},{"creatorName":"横山, 貴紀"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Akihiro, MORITA","creatorNameLang":"en"},{"creatorName":"Hisashi, KOGA","creatorNameLang":"en"},{"creatorName":"Toshinori, WATANABE","creatorNameLang":"en"},{"creatorName":"Takanori, YOKOYAMA","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"グラフのマッチング問題は一般に計算量が膨大であるが，問題固有の属性情報などを用いて効率的な探索を実現できる可能性がある．本研究では，グラフマッチング問題が入力2グラフから生成される積グラフの最大クリークを抽出する問題へ還元できることに着目し，その効率化のために2つの属性情報利用アルゴリズムを考案した．1つ目はクリーク抽出の探索過程で属性情報を用いて探索領域を削減する方法，2つ目は積グラフの生成時に属性情報を用いて積グラフの規模自体を抑制する方法である．これらを計算機実験によって比較検証した結果，双方共に有効であるが，特に後者の有効性が顕著であることを確認した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Graph matching problem has a very high computational complexity. But we can reduce it by exploiting domain-specific information such as object's attributes. In this research, where we solve the graph matching problem by reducing it into a maximum clique problem in a product graph generated from the two input graphs, we propose two algorithms, both exploiting attribute information. One is the method of decreasing the search space by using attribute information in the process of maximum clique search. The other is the method of decreasing the size of the product graph by using attribute information during the product graph generation. Through experiments we showed that, although both are effective, the latter dominates the former.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"54","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"49","bibliographicIssueDates":{"bibliographicIssueDate":"2006-03-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"30(2006-AL-105)","bibliographicVolumeNumber":"2006"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:00.791109+00:00","updated":"2025-01-22T16:30:21.967389+00:00"}