【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算法。该算法基于连续点的短距离和由三个相邻点形成的连续向量之间的小角度的概念。在本文中,我们提出了对新开发的SDSA算法(MSDS)的修改。 MSDS算法几乎适用于Chung和Liu用于基于点对称的K均值(PSK)算法和SDSA算法的所有测试数据集。而且,它比SDSA算法更有效,因为MSDS算法所需的每次迭代计算量比SDSA算法所需的计算量少得多。实验结果表明,我们提出的MSDS算法令人鼓舞。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号