Ping-pong Document Clustering using NMF and Linkage-Based Refinement
Ping-pong Document Clustering using NMF and Linkage-Based Refinement
复制标题
DOI：
--
复制
发表时间：
2008-05
期刊：
影响因子：
--
通讯作者：
Hiroyuki Shinnou;Minoru Sasaki
中科院分区：
文献类型：
--
作者：
Hiroyuki Shinnou;Minoru Sasaki
为了提高NMF的聚类效果，提出了一种交替使用NMF和基于链接的细化的乒乓文档聚类方法。NMF在乒乓策略中的使用可以预期对文档聚类的有效性。然而，乒乓策略中的NMF往往会降低性能，因为NMF往往无法改善作为初始值的聚类结果。我们的方法处理这个问题的乒乓过程的停止条件。在实验中，我们使用16个文档数据集，将我们的方法与k-means和NMF进行了比较。该方法显著改善了NMF的聚类结果。
This paper proposes a ping-pong document clustering method using NMF and the linkage based refinement alternately, in order to improve the clustering result of NMF. The use of NMF in the ping-pong strategy can be expected effective for document clustering. However, NMF in the ping-pong strategy often worsens performance because NMF often fails to improve the clustering result given as the initial values. Our method handles this problem with the stop condition of the ping-pong process. In the experiment, we compared our method with the k-means and NMF by using 16 document data sets. Our method improved the clustering result of NMF significantly.