arrow
返回

Single-Objective/Multiobjective Cat Swarm Optimization Clustering Analysis for Data Partition

delete2020-01-01
delete20
PRE
AI
D
Dapeng Yan
H
Hui Cao *
Y
Yajie Yu
王燕霞 封面图
王燕霞 (Yanxia Wang)
X
Xiang Yu
DOI:10.1109/TASE.2020.2969485delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This article proposes single-objective/multiobjective cat swarm optimization clustering algorithms for data partition. The proposed methods use the cat swarm to search the optimal. The position of the cat tightly associates with the clustering centers and is updated by two submodes: the seeking mode and the tracing mode. The seeking mode uses the simulated annealing strategy to update the cat position at a probability. Inspired by the quantum theories, the tracing mode adopts the quantum model to update the cat position in the whole solution space. First, the single-objective method is proposed and adopts the cohesion of clustering as the objective function, in which the kernel method is applied. For considering more objective functions to reveal diverse aspects of data, the multiobjective method is proposed and adopts both the cohesion and the connectivity as the objective functions. The Pareto optimization method is applied to balance the objectives. In the experiments, three kinds of data sets are used to examine the effectiveness of the proposed methods, which are three synthetic data sets, four data sets from the UCI Machine Learning Repository, and a field data set. Experimental results verified that the proposed methods perform better than the traditional clustering algorithms, and the proposed multiobjective method has the highest accuracy. Note to Practitioners-This article presents single-objective/multiobjective cat swarm optimization clustering analysis methods for data partition. Through automatically extracting meaningful or useful classes, clustering analysis could help the practitioners or the intelligent devices find the specific meanings of data, natural data structure, the data relationships, or other characteristics. The proposed methods use the cat swarm to search the optimal clustering result. One or more criterion functions could be selected as the optimization objectives. The time complexity of the multiobjective type is higher than that of the single-objective type. Therefore, in the industrial field, engineers should choose the number of the optimization objectives based on the actual requirements. The proposed methods could be widely used into industrial applications to deal with complex data sets. Future research could consider some more progressive optimization schemes to improve the effectiveness.
Keyword:
Cats
Clustering algorithms
Particle swarm optimization
Optimization
Linear programming
Genetic algorithms
Convergence
Clustering analysis
data partition
quantum model
single-objective
multiobjective optimization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Automation Science and Engineering 封面图
IEEE Transactions on Automation Science and Engineering
IF:
6.4
论文数:
5.1K
被引数:
1.6W

机构

X
xi'an jiaotong university
学者数:
9.3W
论文数: 6.7W
被引数: 75
B
Beijing University of Technology
学者数:
2.8W
论文数: 2.1W
被引数: 2.7W
引用论文

引用论文

Isolation of the three grape sub-lineages of B-class MADS-box TM6, PISTILLATA and APETALA3 genes which are differentially expressed during flower and fruit development
errGene
IF0
err2007-12-01
err0
PREAI
errMaría Josefina Poupin; Fernán Federici; Consuelo Medina; José Tomás Matus; Tania Timmermann; Patricio Arce-Johnson
err分享
err收藏
Relationship Between Odor Intensity Estimates and COVID-19 Prevalence Prediction in a Swedish Population
err2020-05-22
err0
errOAAI
errBehzad Iravani; Artin Arshamian; Aharon Ravia; Eva Mishor; Kobi Snitz; Sagit Shushan; Yehudah Roth; Ofer Perl; Danielle Honigstein; Reut Weissgross; Shiri Karagach; Gernot Ernst; Masako Okamoto; Zachary Mainen; Erminio Monteleone; Caterina Dinnella; Sara Spinelli; Franklin Mariño-Sánchez; Camille Ferdenzi; Monique Smeets; Kazushige Touhara; Moustafa Bensafi; Thomas Hummel; Noam Sobel; Johan N Lundström
err分享
err收藏
学者 查看更多内容