【24h】

Modified SDSA clustering algorithm

机译:修改了SDSA聚类算法

获取原文
获取外文期刊封面目录资料

摘要

An effective clustering algorithm, named SDSA algorithm, is developed recently by Wei Li, Haohao Li and Jianye Chen. The algorithm based on the concept of the short distance of the consecutive points and the small angle between the consecutive vectors formed by three adjacent points. In this paper, we present a modification of the newly developed SDSA algorithm (MSDS). The MSDS algorithm is suitable for almost all test data sets used by Chung and Liu for point symmetry based K-means (PSK) algorithm and SDSA algorithm. Also, its much more effective than SDSA algorithm, since the computational effort per iteration required by MSDS algorithm is a lot less than that required by SDSA algorithm. Experimental results demonstrate that our proposed MSDS algorithm is rather encouraging.
机译:一种名为SDSA算法的有效聚类算法,最近由Wei Li,Haohao Li和Jianye Chen开发。基于连续点的短距离的概念的算法和三个相邻点形成的连续向量之间的小角度。在本文中,我们提出了新开发的SDSA算法(MSDS)的修改。 MSDS算法适用于Chung和Liu的几乎所有测试数据集,用于基于点对称的K均值(PSK)算法和SDSA算法。此外,它比SDSA算法更有效,因为MSDS算法所需的每个迭代的计算工作量小于SDSA算法所需的计算。实验结果表明,我们所提出的MSDS算法相当令人鼓舞。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号