{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00029563","sets":["1164:2240:2289:2292"]},"path":["2292"],"owner":"1","recid":"29563","title":["決定木の並列化とその評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"1999-08-02"},"_buckets":{"deposit":"6cc0227e-9e2f-4de8-a728-014850391de3"},"_deposit":{"id":"29563","pid":{"type":"depid","value":"29563","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":"Parallelization of Decision Tree Algorithm and its Performance Evaluation","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1999-08-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/29563/files/IPSJ-HPC99077028.pdf"},"date":[{"dateType":"Available","dateValue":"2001-08-02"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC99077028.pdf","filesize":[{"value":"658.9 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":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"403d8b19-9c61-453f-9473-b5306c161652","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1999 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":"AN10463942","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":"数百ギガから数テラバイトクラスのデータに対するデータマイニングを実用時間で行えるシステムの構築を検討している。その知見を得るために、データマイニングの代表的な手法である決定木を並列化して高速化し、百メガバイト程度のベンチマークデータおよび実データを用いて効果を調べた。決定木では、ルートから順にノードが生成されていく。1つのノード内の処理を並列化する手法（ノード内並列）と、複数のノードを並列に処理する手法（ノード間並列）を実装し、C4．5というフリーソフトをSMPマシンをターゲットとして並列化した。プロファイリングで処理のボトルネックを調べ、その部分のスレッドプログラミングを用いて並列化した。ノード内並列は、データの性質によらず8CPUで3倍から6倍程度の高速化が図れた。ノード間並列は、生成される木の偏りに大きく影響を受け、4倍程度高速化されたものから、全く高速化されないものもあった。","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 data of form several 100giga byte to tera byte class. In order to obtain the knowledge for the construction of the system, the decision tree which is the typical technique of a data-mining is parallelized and accelerated. It applied to the data of a 100mega byte class, and was evaluated using benchmark data and real data. On the decision tree, nodes are generated from a root node to leaf nodes. The technique (intra-node parallel) of parallelizing processing in one node and the technique (inter-node parallel) of processing two or more nodes in parallel were implemented. A free software called C4.5 was parallelized for SMP machine. The bottleneck of processing was investigated by profiling and it was parallelized using thread programming. The effect of intra-node parallization was not affected by the characteristic of data, but was able to attain improvement in the speed of 3 to about 6 times by 8 CPUs. Inter-node parallization received influence in the deviation of the tree generated greatly, and there was from what was accelerated about 4 times to what is not accelerated at all.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"166","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"161","bibliographicIssueDates":{"bibliographicIssueDate":"1999-08-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"66(1999-HPC-077)","bibliographicVolumeNumber":"1999"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":29563,"updated":"2025-01-22T17:30:03.910271+00:00","links":{},"created":"2025-01-18T22:59:22.813535+00:00"}