...
首页> 外文期刊>Mathematical Problems in Engineering >A Fuzzy Co-Clustering Algorithm via Modularity Maximization
【24h】

A Fuzzy Co-Clustering Algorithm via Modularity Maximization

机译:模块化最大化的模糊共聚算法

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

摘要

In this paper we propose a fuzzy co-clustering algorithm via modularity maximization, named MMFCC. In its objective function, we use the modularity measure as the criterion for co-clustering object-feature matrices. After converting into a constrained optimization problem, it is solved by an iterative alternative optimization procedure via modularity maximization. This algorithm offers some advantages such as directly producing a block diagonal matrix and interpretable description of resulting co-clusters, automatically determining the appropriate number of final co-clusters. The experimental studies on several benchmark datasets demonstrate that this algorithm can yield higher quality co-clusters than such competitors as some fuzzy co-clustering algorithms and crisp block-diagonal co-clustering algorithms, in terms of accuracy.
机译:在本文中,我们提出了一种通过模块化最大化的模糊共聚算法,即MMFCC。在其目标函数中,我们使用模块化度量作为共聚对象特征矩阵的标准。转换为约束优化问题后,可通过模块化最大化通过迭代替代优化过程解决该问题。该算法具有一些优势,例如直接生成块对角线矩阵以及对所得的共同集群进行可解释的描述,自动确定最终的共同集群的适当数量。在几个基准数据集上的实验研究表明,就准确性而言,该算法比某些模糊共聚算法和清晰块对角共聚算法可产生更高质量的共聚。

著录项

  • 来源
    《Mathematical Problems in Engineering 》 |2018年第14期| 3757580.1-3757580.11| 共11页
  • 作者单位

    Henan Polytech Univ, Sch Comp Sci & Technol, Jiaozuo 454003, Henan, Peoples R China;

    Henan Polytech Univ, Sch Comp Sci & Technol, Jiaozuo 454003, Henan, Peoples R China;

    Henan Polytech Univ, Sch Comp Sci & Technol, Jiaozuo 454003, Henan, Peoples R China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号