{"created":"2025-01-18T22:51:27.305997+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018825","sets":["1164:1165:1170:1171"]},"path":["1171"],"owner":"1","recid":"18825","title":["ラベル付きグラフのフィルタリングのための行列サイズ縮小手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-07-04"},"_buckets":{"deposit":"2fcb65f6-60d9-447e-a634-89a3508684a1"},"_deposit":{"id":"18825","pid":{"type":"depid","value":"18825","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":"Reduction of Matrix Order for Filtering Labeled Graphs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2007-07-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"首都大学東京システムデザイン研究科"},{"subitem_text_value":"首都大学東京システムデザイン研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of System Design, Tokyo Metropolitan University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of System Design, Tokyo Metropolitan University","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/18825/files/IPSJ-DBS07143079.pdf"},"date":[{"dateType":"Available","dateValue":"2009-07-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS07143079.pdf","filesize":[{"value":"839.3 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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2dedf931-024f-41df-8973-fe2390c001ac","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"長屋, 未来"},{"creatorName":"片山, 薫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hideki, NAGAYA","creatorNameLang":"en"},{"creatorName":"Kaoru, KATAYAMA","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","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":"画像における特徴量抽出、化学式における類似構造の検出などに部分グラフ同型判定は応用できる。しかし部分グラフ同型判定問題は NP 完全であり、大規模なグラフを扱う場合、実用時間内に解くことが困難である。我々は部分グラフ同型判定の前処理として、対称行列の固有値に関する事実(Cauchy の interlace 定理)を利用することを提案し、その有効性を確認した。固有値計算に必要な行列サイズを縮小する事で interlace 定理を利用するためのコストを減らし、interlace 定理の判定精度を改善する事は有効であると考えられる。本稿では、ラベルを利用してグラフをフィルタリングすると共に、グラフを表現する行列のサイズを縮小する手法を提案する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"It is often used to solve the subgraph isomorphism problem in various application such as retrieval for a chemical formula, feature extraction from pictures. This problem is NP-complete and require large computation cost to solve it. We suggested to use the fact concerning the symmetric eigenvalue (Cauchy's interlace theorem) as a preprocessing of the subgraph isomorphism. It is effective to reduce order of the matrix for decreasing the cost to calculate eigenvalue. In this paper, we suggest a method reducing order of the matrix while filtering labeled graphs by using label of graphs.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"472","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"467","bibliographicIssueDates":{"bibliographicIssueDate":"2007-07-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"65(2007-DBS-143)","bibliographicVolumeNumber":"2007"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"links":{},"id":18825,"updated":"2025-01-22T22:34:18.000921+00:00"}