首页> 外文会议>International Conference on Contemporary Computing and Informatics >Modified differential evolution based 0/1 clustering for classification of data points: Using modified new point symmetry based distance and dynamically controlled parameters
【24h】

Modified differential evolution based 0/1 clustering for classification of data points: Using modified new point symmetry based distance and dynamically controlled parameters

机译:基于修改的差分演进0/1群集用于数据点的分类:使用基于修改的新点对称的距离和动态控制的参数

获取原文

摘要

Identification of Clusters is a complex task as clusters found in the data sets are of arbitrary shapes and sizes. The task becomes challenging as identification of all the clusters from a single data set requires use of different types of algorithms based on different distance measures. Symmetry is a commonly used property of objects. Many of the clusters present in a data set can be identified using some point symmetry based distances. Point symmetry based and Euclidean distance measures are individually best in identifying clusters in some particular cases but not together. This article proposes a solution after analyzing and removing the shortcomings in both types of distance measures and then merging the improved versions into one to get the best of both of them. Introduction of differential evolution based optimization technique with dynamic parameter selection further enhances the quality of results. In this paper the existing point symmetry based distance is modified and is also enabled to correctly classify clusters based on Euclidean distance without making a dynamic switch between the methods. This helps the proposed clustering technique to give a speed up in computation process. The efficiency of the algorithm is established by analyzing the results obtained on 2 diversified test data sets. With the objective of highlighting the improvements achieved by our proposed algorithm, we compare its results with the results of algorithm based purely on Euclidean Distance, new point symmetry distance and the proposed modified new point symmetry based distance.
机译:群集的识别是一个复杂的任务,因为在数据集中发现的群集是任意形状和大小。由于识别来自单个数据集的所有集群的识别需要使用基于不同距离测量的不同类型的算法来具有挑战性。对称是对象的常用属性。可以使用基于点对称的距离来识别数据集中存在的许多簇。基于点对称的和欧几里德距离测量在某些特定情况下识别群集而且不包括在一起。本文在分析和删除两种距离措施中的缺点后提出了解决方案,然后将改进版本合并到一个以获得它们中最好的。基于差分演化的优化技术引入动态参数选择进一步提高了结果的质量。在本文中,修改了现有的基于点对称的距离,并且还能够基于欧几里德距离正确分类群集而不在该方法之间进行动态开关。这有助于提出的聚类技术在计算过程中升级。通过分析在2个多样化的测试数据集中获得的结果来建立算法的效率。凭借突出我们所提出的算法实现的改进的目的,我们将其结果与纯粹对欧几里德距离,新点对称距离和所提出的基于修改的新点对称的距离的算法进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号