ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング


インデックスリンク

インデックスツリー

  • RootNode

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 研究報告
  2. 情報基礎とアクセス技術(IFAT)
  3. 2014
  4. 2014-IFAT-116

Algorithm for Hierarchical Multi-way Divisive Clustering of Document Collections

https://ipsj.ixsq.nii.ac.jp/records/106485
https://ipsj.ixsq.nii.ac.jp/records/106485
5b529e49-4c47-4671-bd8b-faa93cd87556
名前 / ファイル ライセンス アクション
IPSJ-IFAT14116001.pdf IPSJ-IFAT14116001.pdf (793.3 kB)
Copyright (c) 2014 by the Information Processing Society of Japan
オープンアクセス
Item type SIG Technical Reports(1)
公開日 2014-11-04
タイトル
タイトル Algorithm for Hierarchical Multi-way Divisive Clustering of Document Collections
タイトル
言語 en
タイトル Algorithm for Hierarchical Multi-way Divisive Clustering of Document Collections
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_18gh
資源タイプ technical report
著者所属
School of Library and Information Science, Keio University
著者所属(英)
en
School of Library and Information Science, Keio University
著者名 Kazuaki, Kishida

× Kazuaki, Kishida

Kazuaki, Kishida

Search repository
著者名(英) Kazuaki, Kishida

× Kazuaki, Kishida

en Kazuaki, Kishida

Search repository
論文抄録
内容記述タイプ Other
内容記述 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.
論文抄録(英)
内容記述タイプ Other
内容記述 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.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN10114171
書誌情報 研究報告情報基礎とアクセス技術(IFAT)

巻 2014-IFAT-116, 号 1, p. 1-8, 発行日 2014-11-04
Notice
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-21 09:30:07.043289
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3