• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Fuzzy Systems and Knowledge Discovery >Fuzzy equivalence relation clustering with transitive closure, transitive opening and the optimal transitive approximation
【24h】

Fuzzy equivalence relation clustering with transitive closure, transitive opening and the optimal transitive approximation

机译：具有传递闭包，传递开度和最优传递逼近的模糊等价关系聚类

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, the fuzzy equivalence relation clustering is studied. Firstly, an algorithm for obtaining a transitive lower approximation or a suboptimal transitive approximation of a fuzzy similarity relation is given. Secondly, the relationship between fuzzy equivalence relation clustering and the agglomerative hierarchical clustering is investigated. Thirdly, a clustering method combining fuzzy equivalence relation clustering and fuzzy c-means clustering is proposed. Finally, numerical experiments are carried out to verify the algorithm.
机译：本文研究了模糊等价关系聚类。首先，给出了获得模糊相似关系的传递下近似或次优传递近似的算法。其次，研究了模糊等价关系聚类和凝聚层次聚类之间的关系。第三，提出了一种将模糊等价关系聚类和模糊c均值聚类相结合的聚类方法。最后，通过数值实验对算法进行了验证。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号