{"title":"Alpsoc蚂蚁狮子*:粒子群优化混合k -媒质聚类","authors":"T. M. Murugan, E. Baburaj","doi":"10.1109/ICSTCEE49637.2020.9277088","DOIUrl":null,"url":null,"abstract":"K-medoids clustering aims at partitioning a numerous data points into different K medoids based on the similarity distance between object pair. Cluster efficiency varies with respect to medoid initialization and may results in local optima traps. Various evolutionary swarm based approaches are adopted to obtain enhanced performance. Suitable combination of K-medoids with optimization technique does not operate well as expected while considering computational time. No such techniques are developed to solve entire clustering drawbacks. Assurance is not provided to any method in attaining success by solving the overall issues. Hence in this, an improved K-medoids integrated with Ant lion optimization and Particle swarm optimization algorithm commonly referred as ALPSOC is proposed to obtain optimized cluster centroid in which the computational complexity is preserved with better improvements in performance. Further the intra-cluster distance, F-measure, Rand Index, Adjusted Rand Index, Entropy and Normalized Mutual Information is evaluated for different datasets adopting the presented approach. The proposed algorithm is simulated on different datasets and is compared with different existing techniques based on above performance metric. From the observed results, it is shown that the proposed method functions better in all cases maintaining to solve clustering limitations.","PeriodicalId":113845,"journal":{"name":"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Alpsoc Ant Lion * : Particle Swarm Optimized Hybrid K-Medoid Clustering\",\"authors\":\"T. M. Murugan, E. Baburaj\",\"doi\":\"10.1109/ICSTCEE49637.2020.9277088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"K-medoids clustering aims at partitioning a numerous data points into different K medoids based on the similarity distance between object pair. Cluster efficiency varies with respect to medoid initialization and may results in local optima traps. Various evolutionary swarm based approaches are adopted to obtain enhanced performance. Suitable combination of K-medoids with optimization technique does not operate well as expected while considering computational time. No such techniques are developed to solve entire clustering drawbacks. Assurance is not provided to any method in attaining success by solving the overall issues. Hence in this, an improved K-medoids integrated with Ant lion optimization and Particle swarm optimization algorithm commonly referred as ALPSOC is proposed to obtain optimized cluster centroid in which the computational complexity is preserved with better improvements in performance. Further the intra-cluster distance, F-measure, Rand Index, Adjusted Rand Index, Entropy and Normalized Mutual Information is evaluated for different datasets adopting the presented approach. The proposed algorithm is simulated on different datasets and is compared with different existing techniques based on above performance metric. From the observed results, it is shown that the proposed method functions better in all cases maintaining to solve clustering limitations.\",\"PeriodicalId\":113845,\"journal\":{\"name\":\"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)\",\"volume\":\"214 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCEE49637.2020.9277088\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCEE49637.2020.9277088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
K-medoids clustering aims at partitioning a numerous data points into different K medoids based on the similarity distance between object pair. Cluster efficiency varies with respect to medoid initialization and may results in local optima traps. Various evolutionary swarm based approaches are adopted to obtain enhanced performance. Suitable combination of K-medoids with optimization technique does not operate well as expected while considering computational time. No such techniques are developed to solve entire clustering drawbacks. Assurance is not provided to any method in attaining success by solving the overall issues. Hence in this, an improved K-medoids integrated with Ant lion optimization and Particle swarm optimization algorithm commonly referred as ALPSOC is proposed to obtain optimized cluster centroid in which the computational complexity is preserved with better improvements in performance. Further the intra-cluster distance, F-measure, Rand Index, Adjusted Rand Index, Entropy and Normalized Mutual Information is evaluated for different datasets adopting the presented approach. The proposed algorithm is simulated on different datasets and is compared with different existing techniques based on above performance metric. From the observed results, it is shown that the proposed method functions better in all cases maintaining to solve clustering limitations.