{"created":"2025-01-18T23:49:52.851828+00:00","updated":"2025-01-21T09:30:08.213613+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00106485","sets":["1164:3500:7443:7726"]},"path":["7726"],"owner":"11","recid":"106485","title":["Algorithm for Hierarchical Multi-way Divisive Clustering of Document Collections"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-11-04"},"_buckets":{"deposit":"cb9ed43d-67c4-4f33-b6d5-8f469e138469"},"_deposit":{"id":"106485","pid":{"type":"depid","value":"106485","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Algorithm for Hierarchical Multi-way Divisive Clustering of Document Collections","author_link":["11882","11883"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Algorithm for Hierarchical Multi-way Divisive Clustering of Document Collections"},{"subitem_title":"Algorithm for Hierarchical Multi-way Divisive Clustering of Document Collections","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2014-11-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"School of Library and Information Science, Keio University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"School of Library and Information Science, Keio University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/106485/files/IPSJ-IFAT14116001.pdf"},"date":[{"dateType":"Available","dateValue":"2016-11-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IFAT14116001.pdf","filesize":[{"value":"793.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":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"4f308e83-3487-4ea4-9b10-581d40827926","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuaki, Kishida"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuaki, Kishida","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10114171","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":"This paper proposes a novel algorithm of hierarchical divisive clustering, which generates a multi-branch tree, not a binary one, as its output. In order to use the algorithm for clustering large document sets, a spherical k-means clustering algorithm based on a cosine measure is adopted for partitioning recursively the document set from the top to bottom. Also, by selecting automatically the number of clusters in each partitioning according to a criterion, an optimal multi-way branching is determined for each node of the tree. This paper reports an experimental result indicating the effectiveness of the proposed algorithm.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper proposes a novel algorithm of hierarchical divisive clustering, which generates a multi-branch tree, not a binary one, as its output. In order to use the algorithm for clustering large document sets, a spherical k-means clustering algorithm based on a cosine measure is adopted for partitioning recursively the document set from the top to bottom. Also, by selecting automatically the number of clusters in each partitioning according to a criterion, an optimal multi-way branching is determined for each node of the tree. This paper reports an experimental result indicating the effectiveness of the proposed algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告情報基礎とアクセス技術（IFAT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2014-11-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2014-IFAT-116"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":106485,"links":{}}