{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00023727","sets":["1164:1579:1628:1632"]},"path":["1632"],"owner":"1","recid":"23727","title":["PCクラスタを用いた決定木生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2000-03-02"},"_buckets":{"deposit":"3476359c-d106-444d-9f85-fd0cb9d1d118"},"_deposit":{"id":"23727","pid":{"type":"depid","value":"23727","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"PCクラスタを用いた決定木生成","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"PCクラスタを用いた決定木生成"},{"subitem_title":"Parallelization of Decision Tree Algorithm on PC Cluster","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2000-03-02","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":"Parallel Application Toshiba Laboratory Real World Computing Partnership","subitem_text_language":"en"},{"subitem_text_value":"Parallel Application Toshiba Laboratory Real World Computing Partnership","subitem_text_language":"en"},{"subitem_text_value":"Parallel Application Toshiba Laboratory Real World Computing Partnership","subitem_text_language":"en"},{"subitem_text_value":"Parallel Application Toshiba Laboratory Real World Computing Partnership","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/23727/files/IPSJ-ARC99137020.pdf"},"date":[{"dateType":"Available","dateValue":"2002-03-02"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC99137020.pdf","filesize":[{"value":"646.8 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6c4c2411-4de3-4110-a8d7-9f3e73a15c8b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2000 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":"Kazuto, Kubota","creatorNameLang":"en"},{"creatorName":"Akihiko, Nakase","creatorNameLang":"en"},{"creatorName":"Hiroshi, Sakai","creatorNameLang":"en"},{"creatorName":"Shigeru, Oyanagi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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":"数百ギガから数テラバイトクラスのデータに対するデータマイニングを実用時間で行えるシステムの構築を検討している．その知見を得るために，データマイニングの代表的な手法である決定木について，PCクラスタをターゲットとした並列アルゴリズムを実装し，予備評価を行った．本手法の特徴は，データを重複なく各プロセッサに分散配置すること，中間データをディスク上に置くことで大規模なデータを扱えること，処理手順を動的に決めることでディスクアクセスの軽減が図れることである．ベンチマークデータを用いた実験により，16台のプロセッサで11?24倍程度の高速化が実現された．また，オンメモリでは処理できない大規模なデータに対して動的に処理手順を変更する手法が有効であるという結果が得られた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We are planning to develop a practical data-mining system to the hundreds of Giga or Tera byte class data. In order to obtain the knowledge for the construction of the system, the decision tree which is the typical technique in data-mining is parallelized and implemented on a PC cluster. Our method has the following features. Input data are distributed to each processor element without overlap. Intermediate data are stored on disks, so that large size data can be executed. Disk access is decreased by dynamic execution order changing. Experimental results show that from 11 to 24 times acceleration is achieved by 16 processors, and dynamic execution order changing technique is effective for large scale data which cannot be solved on memory execution.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"118","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告計算機アーキテクチャ（ARC）"}],"bibliographicPageStart":"113","bibliographicIssueDates":{"bibliographicIssueDate":"2000-03-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"23(1999-ARC-137)","bibliographicVolumeNumber":"2000"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":23727,"updated":"2025-01-22T20:14:52.908295+00:00","links":{},"created":"2025-01-18T22:55:03.476389+00:00"}