Clustering and classification with inertia weight and elitism-based particle swarm optimization

被引:0
作者
Murugan, T. Mathi [1 ]
Baburaj, E. [2 ]
机构
[1] Sathyabama Inst Sci & Technol, Fac Comp Sci & Engn, Chennai, Tamil Nadu, India
[2] Marian Engn Coll, Dept Comp Sci Engn, Trivandrum, Kerala, India
关键词
Machine learning; k-medoids clustering; Particle swarm optimization; Elitism; k-nearest neighbor classifier; ALGORITHM;
D O I
10.1007/s10044-021-01010-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering and classification-based pattern recognition techniques are widely used in various domains. While many approaches exist to perform these tasks, it remains a difficult process to perform clustering and classification simultaneously for particular datasets. In this paper, a method based on k-nearest neighbor (KNN) is presented to classify the dataset with PSO optimized k-medoids clustering. Initial clustering with k-medoids algorithm divides the dataset into smaller and disjoint clusters featuring similarity within clusters and dissimilarity with members of other clusters. Particle swarm optimization (PSO) is an evolutionary algorithm mainly used to optimize the issues in several research areas including data analytics. The fitness function of the PSO approach mentioned in this paper is based on inertia weights that identify the particles with the best positions and velocities for optimization. Additionally, PSO uses a novel elitism concept that allows massive searching capability between the swarm of particles to achieve a better convergence rate. Because of this property, it can be applied throughout different machine learning fields. Moreover, the KNN classifier outperforms the classification task in terms of classifying the optimized particles with high accuracy. The performance of the proposed technique is evaluated by experimenting with datasets taken from open sources. The simulation results revealed that the performance of the proposed method is better than the existing methods in terms of effective clustering as well as accurate classification.
引用
收藏
页码:1605 / 1621
页数:17
相关论文
共 31 条
[1]   A novel SVM-kNN-PSO ensemble method for intrusion detection system [J].
Aburomman, Abdulla Amin ;
Reaz, Mamun Bin Ibne .
APPLIED SOFT COMPUTING, 2016, 38 :360-372
[2]   Density-based particle swarm optimization algorithm for data clustering [J].
Alswaitti, Mohammed ;
Albughdadi, Mohanad ;
Isa, Nor Ashidi Mat .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 91 :170-186
[3]   Automatic Clustering of Macroseismic Intensity Data Points from Internet Questionnaires: Efficiency of the Partitioning around Medoids (PAM) [J].
Amorese, Daniel ;
Bossu, Remy ;
Mazet-Roux, Gilles .
SEISMOLOGICAL RESEARCH LETTERS, 2015, 86 (04) :1171-1177
[4]   Enterotypes of the human gut microbiome [J].
Arumugam, Manimozhiyan ;
Raes, Jeroen ;
Pelletier, Eric ;
Le Paslier, Denis ;
Yamada, Takuji ;
Mende, Daniel R. ;
Fernandes, Gabriel R. ;
Tap, Julien ;
Bruls, Thomas ;
Batto, Jean-Michel ;
Bertalan, Marcelo ;
Borruel, Natalia ;
Casellas, Francesc ;
Fernandez, Leyden ;
Gautier, Laurent ;
Hansen, Torben ;
Hattori, Masahira ;
Hayashi, Tetsuya ;
Kleerebezem, Michiel ;
Kurokawa, Ken ;
Leclerc, Marion ;
Levenez, Florence ;
Manichanh, Chaysavanh ;
Nielsen, H. Bjorn ;
Nielsen, Trine ;
Pons, Nicolas ;
Poulain, Julie ;
Qin, Junjie ;
Sicheritz-Ponten, Thomas ;
Tims, Sebastian ;
Torrents, David ;
Ugarte, Edgardo ;
Zoetendal, Erwin G. ;
Wang, Jun ;
Guarner, Francisco ;
Pedersen, Oluf ;
de Vos, Willem M. ;
Brunak, Soren ;
Dore, Joel ;
Weissenbach, Jean ;
Ehrlich, S. Dusko ;
Bork, Peer .
NATURE, 2011, 473 (7346) :174-180
[5]  
Bishop Christopher M, 2006, PATTERN RECOGN, V128, P1, DOI [10.1117/1.2819119, DOI 10.1117/1]
[6]  
BLASHFIELD RK, 1991, J CLASSIF, V8, P277
[7]  
Boro Debojit, 2015, International Journal of Innovative Computing and Applications, V6, P145
[8]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[9]  
de Falco I, 2006, LECT NOTES ARTIF INT, V3849, P164
[10]  
Del Ser J, 2019, SWARM INTELLIGENCE R