基于0/1聚类的改进差分进化数据点分类:使用改进的基于距离和动态控制参数的新点对称

Vikram Singh, S. Saha
{"title":"基于0/1聚类的改进差分进化数据点分类:使用改进的基于距离和动态控制参数的新点对称","authors":"Vikram Singh, S. Saha","doi":"10.1109/IC3I.2014.7019722","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"77 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Modified differential evolution based 0/1 clustering for classification of data points: Using modified new point symmetry based distance and dynamically controlled parameters\",\"authors\":\"Vikram Singh, S. Saha\",\"doi\":\"10.1109/IC3I.2014.7019722\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":430848,\"journal\":{\"name\":\"2014 International Conference on Contemporary Computing and Informatics (IC3I)\",\"volume\":\"77 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Contemporary Computing and Informatics (IC3I)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3I.2014.7019722\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3I.2014.7019722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

簇的识别是一项复杂的任务,因为在数据集中发现的簇具有任意形状和大小。这项任务变得具有挑战性,因为从单个数据集中识别所有簇需要使用基于不同距离度量的不同类型的算法。对称是物体的一种常用属性。数据集中存在的许多簇可以使用一些基于点对称的距离来识别。在某些特殊情况下,基于点对称和欧几里得距离的度量分别是识别聚类的最佳方法,但不能同时使用。本文通过分析和消除这两种距离测量方法的不足,并将改进后的版本合并为一种方法,以达到两者的最佳效果。引入基于差分进化的动态参数选择优化技术,进一步提高了优化结果的质量。本文对现有的基于点对称距离的聚类方法进行了改进,使得基于欧几里得距离的聚类方法能够正确分类,而无需在两种方法之间进行动态切换。这有助于提高聚类技术在计算过程中的速度。通过对2个多样化测试数据集的结果分析,验证了该算法的有效性。为了突出本文提出的算法所取得的改进,我们将其结果与纯基于欧几里得距离的算法、新的点对称距离和改进的基于新点对称距离的算法的结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modified differential evolution based 0/1 clustering for classification of data points: Using modified new point symmetry based distance and dynamically controlled parameters
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信