首页> 外文会议>International Conference on Discovery Science >LF-CARS: A Loose Fragment-Based Consensus Clustering Algorithm with a Robust Similarity
【24h】

LF-CARS: A Loose Fragment-Based Consensus Clustering Algorithm with a Robust Similarity

机译:LF-CARS:基于松散的片段的共识群体聚类算法,具有鲁棒性的相似性

获取原文

摘要

The consensus clustering technique is to combine multiple clustering results without accessing the original data. It can be used to obtain the clustering result from multiple data sources or to improve the robustness of clustering result. In this paper, we propose a novel definition of the similarity between points and clusters to represent how a point should join or leave a cluster clearly. With this definition of similarity, we desigh an iterative process which can determine the number of clusters automatically. In addition, we propose the concept loose fragment which is improved from clustering fragment into our method for speed-up. The experimental results show that our algorithm achieves good performances on both artificial data and real data.
机译:共识群集技术是组合多个聚类结果而不访问原始数据。它可用于从多个数据源获取群集结果或提高聚类结果的稳健性。在本文中,我们提出了一种新颖的定义点与集群之间的相似性,以表示如何清楚地加入或留下集群。通过这种相似性的定义,我们致命了一个迭代过程,可以自动确定群集数量。此外,我们提出了概念松散的片段,这些片段从聚类片段改善到我们加速方法。实验结果表明,我们的算法在人工数据和真实数据上实现了良好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号