{"created":"2025-01-19T01:01:05.372894+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00196391","sets":["6504:9795:9803"]},"path":["9803"],"owner":"6748","recid":"196391","title":["ネットワークパターンマイニングアルゴリズムの効率的実装"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-02-28"},"_buckets":{"deposit":"ea7f1078-0aa4-4ab4-90ad-a6fc5d5ce3ce"},"_deposit":{"id":"196391","pid":{"type":"depid","value":"196391","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"ネットワークパターンマイニングアルゴリズムの効率的実装","author_link":["469957","469958","469956","469955"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ネットワークパターンマイニングアルゴリズムの効率的実装"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2019-02-28","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名工大"},{"subitem_text_value":"名工大"},{"subitem_text_value":"名工大"},{"subitem_text_value":"名工大"}]},"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/196391/files/IPSJ-Z81-5P-05.pdf","label":"IPSJ-Z81-5P-05.pdf"},"date":[{"dateType":"Available","dateValue":"2019-05-27"}],"format":"application/pdf","filename":"IPSJ-Z81-5P-05.pdf","filesize":[{"value":"517.8 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"6c56d4c3-8c46-430f-ac9f-d32749ba0825","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"戸崎, 友斗"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"武藤, 敦子"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"森山, 甲一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"犬塚, 信博"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"大規模なデータベースから知識を発見する手法としてデータマイニングがある。その中で、複数のテーブルからなるデータベースを対象とする関係データマイニングが存在する。本研究は、関係データマイニングを帰納論理プログラムの枠組みでおこなう。社会ネットワークを扱うアルゴリズムではApriori性を用いて効率化が図られている。しかし、膨大な数のパターンを生成することで計算量が多くなり、実際のデータでは計算ができない。特に、複雑なパターンが支持度の計算に長い時間かかってしまうという問題もある。本研究では、データベースとパターンのマッチングにおいて単一化させる順序を改善することで、支持度の計算を早くすることを目的とする。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"368","bibliographic_titles":[{"bibliographic_title":"第81回全国大会講演論文集"}],"bibliographicPageStart":"367","bibliographicIssueDates":{"bibliographicIssueDate":"2019-02-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2019"}]},"relation_version_is_last":true,"weko_creator_id":"6748"},"links":{},"id":196391,"updated":"2025-01-19T22:46:30.492863+00:00"}