首页> 外文会议>IEEE International Conference on Fuzzy Systems >Clustering with Minimum Spanning Tree using TOPSIS with Multi-Criteria Information
【24h】

Clustering with Minimum Spanning Tree using TOPSIS with Multi-Criteria Information

机译:使用具有多准则信息的TOPSIS与最小生成树聚类

获取原文

摘要

Clustering is the process of grouping similar objects into the same partition and keeping dissimilar objects on different partitions. Clustering algorithms based on Minimum Spanning Tree (MST) have been successfully applied in the separation of non-convex clusters, although the use of individual objective functions limits the algorithms to a reduced set of clustering problems, presenting difficulties in cases of unbalanced, noisy, overlapping datasets, etc. In order to make clustering process more robust, this paper proposes an algorithm based on Minimum Spanning Tree that combines different objective functions using TOPSIS. The algorithm performance was evaluated on real and synthetic datasets. Experimental results indicate that the combination of objective functions improves clustering results compared to individual functions.
机译:群集是将类似对象分组到同一分区中的过程,并在不同分区上保留不同的对象。基于最小生成树(MST)的聚类算法已成功应用于非凸粒的分离,尽管使用单个物理函数将算法限制为减少的集群问题,但在不平衡,嘈杂的情况下呈现困难,重叠的数据集等,为了使聚类过程更加强大,本文提出了一种基于最小生成树的算法,其使用TOPSIS结合不同的目标函数。在实际和合成数据集中评估算法性能。实验结果表明,与个体功能相比,客观函数的组合改善了聚类结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号