{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00011895","sets":["581:677:682"]},"path":["682"],"owner":"1","recid":"11895","title":["Matrix Clustering：CRM向けの新しいデータマイニング手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-08-15"},"_buckets":{"deposit":"00f390c1-d855-4665-93f2-425e1d53a03a"},"_deposit":{"id":"11895","pid":{"type":"depid","value":"11895","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Matrix Clustering：CRM向けの新しいデータマイニング手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Matrix Clustering：CRM向けの新しいデータマイニング手法"},{"subitem_title":"Matrix Clustering: A New Data Mining Algorithm for CRM","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2001-08-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"新情報処理開発機構並列応用東芝研究室"},{"subitem_text_value":"新情報処理開発機構並列応用東芝研究室"},{"subitem_text_value":"新情報処理開発機構並列応用東芝研究室"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"RWCP Parallel Application TOSHIBA Lab","subitem_text_language":"en"},{"subitem_text_value":"RWCP Parallel Application TOSHIBA Lab","subitem_text_language":"en"},{"subitem_text_value":"RWCP Parallel Application TOSHIBA Lab","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/11895/files/IPSJ-JNL4208023.pdf"},"date":[{"dateType":"Available","dateValue":"2003-08-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4208023.pdf","filesize":[{"value":"223.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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"bc3e0d1e-80eb-4f6b-801b-2b3a5dbf3e86","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小柳, 滋"},{"creatorName":"久保田, 和人"},{"creatorName":"仲瀬, 明彦"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shigeru, Oyanagi","creatorNameLang":"en"},{"creatorName":"Kazuto, Kubota","creatorNameLang":"en"},{"creatorName":"Akihiko, Nakase","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ネットワークビジネスにおけるマーケティングでは，CRMが重要である．本稿ではCRM向けの新しいデータマイニング手法としてMatrix Clusteringを提案する．Matrix Clusteringでは顧客と商品より構成される2値行列の行や列を入れ替えることにより密な部分行列を抽出するが，この手法の高速化を目指してピンポン法と呼ぶ新しいアルゴリズムを開発した．ピンポン法では行と列の間でマーカ伝播を繰り返しながら枝刈りを行う．これにより大規模疎行列では行や列を入れ替える方法と比べて大幅な高速化が達成され，さらに見つかる解の品質も優れていることを実験により確認した．また，Matrix ClusteringをWWWアクセスログ分析に応用し，有効なクラスタの発見が可能であることを確認した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A new data mining method named Matrix Clustering  is proposedfor CRM (Customer Relationship Management).Matrix clustering is  defined to generate a dense sub-matrix from asparse binary matrixby exchanging rows and columns.We also propose a new fast algorithm named ping-pong algorithmfor clustering large sparse matrix.The ping-pong algorithm is  1,000 to 10,000 times faster thana naive   algorithm, and the quality of solution is better.This algorithm is also applicable to WWW access log analysis.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2166","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2156","bibliographicIssueDates":{"bibliographicIssueDate":"2001-08-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"42"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"データベース"}]},"weko_creator_id":"1"},"id":11895,"updated":"2025-01-23T01:57:24.384294+00:00","links":{},"created":"2025-01-18T22:46:23.996411+00:00"}