...
首页> 外文期刊>Journal of mathematical modelling and alogrithms >Co-clustering documents and words by minimizing the normalized cut objective function
【24h】

Co-clustering documents and words by minimizing the normalized cut objective function

机译:通过最小化归一化剪切目标函数来共同聚类文档和单词

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I. S. Dhillon, H. Zha and C. Ding. This model consists in creating a bipartite graph based on word frequencies in documents, and whose vertices are both documents and words. The created bipartite graph is then partitioned in a way that minimizes the normalized cut objective function to produce the document clustering. The fusion-fission graph partitioning metaheuristic is applied on several document collections using this word-document co-clustering model. Results demonstrate a real problem in this model partitions found almost always have a normalized cut value lowest than the original document collection clustering. Moreover, measures of the goodness of solutions seem to be relatively independent of the normalized cut values of partitions.
机译:本文遵循由I. S. Dhillon,H。Zha和C. Ding等几位作者于2001年独立引入的词-文档共聚模型。该模型包括根据文档中的单词频率创建一个二部图,其顶点既是文档又是单词。然后以最小化归一化剪切目标函数的方式对创建的二部图进行分区,以产生文档聚类。融合裂变图分区元启发式算法使用此Word文档共聚模型应用于多个文档集合。结果表明,在该模型中存在一个实际问题,发现分区几乎总是具有比原始文档集合聚类最低的归一化剪切值。此外,解决方案优劣的度量似乎相对独立于分区的标准化割值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号