Next Article in Journal
An Optimized Vector Tracking Architecture for Pseudo-Random Pulsing CDMA Signals
Next Article in Special Issue
Neural Network for Metal Detection Based on Magnetic Impedance Sensor
Previous Article in Journal
All Silica Micro-Fluidic Flow Injection Sensor System for Colorimetric Chemical Sensing
Previous Article in Special Issue
Denoising and Motion Artifact Removal Using Deformable Kernel Prediction Neural Network for Color-Intensified CMOS
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Data Clustering Using Moth-Flame Optimization Algorithm

1
Department of Computer Science and Engineering, Siksha ‘O’ Anusandhan (Deemed to be University), Bhubaneswar, Odisha 751030, India
2
Department of Computer Science and Engineering, Thapar Institute of Engineering and Technology, Patiala, Punjab 147004, India
3
School of Engineering and Applied Sciences, Bennett University, Greater Noida 201310, India
4
Department of Mathematics, Faculty of Science, King Khalid University, Abha 62529, Saudi Arabia
5
Department of Mathematics, Faculty of Science, South Valley University, Qena 83523, Egypt
6
Faculty of Computers and Information, South Valley University, Qena 83523, Egypt
*
Author to whom correspondence should be addressed.
Sensors 2021, 21(12), 4086; https://doi.org/10.3390/s21124086
Submission received: 13 May 2021 / Revised: 10 June 2021 / Accepted: 10 June 2021 / Published: 14 June 2021

Abstract

A k-means algorithm is a method for clustering that has already gained a wide range of acceptability. However, its performance extremely depends on the opening cluster centers. Besides, due to weak exploration capability, it is easily stuck at local optima. Recently, a new metaheuristic called Moth Flame Optimizer (MFO) is proposed to handle complex problems. MFO simulates the moths intelligence, known as transverse orientation, used to navigate in nature. In various research work, the performance of MFO is found quite satisfactory. This paper suggests a novel heuristic approach based on the MFO to solve data clustering problems. To validate the competitiveness of the proposed approach, various experiments have been conducted using Shape and UCI benchmark datasets. The proposed approach is compared with five state-of-art algorithms over twelve datasets. The mean performance of the proposed algorithm is superior on 10 datasets and comparable in remaining two datasets. The analysis of experimental results confirms the efficacy of the suggested approach.
Keywords: data clustering; data mining; k-means; moth flame optimization; meta-heuristic data clustering; data mining; k-means; moth flame optimization; meta-heuristic

Share and Cite

MDPI and ACS Style

Singh, T.; Saxena, N.; Khurana, M.; Singh, D.; Abdalla, M.; Alshazly, H. Data Clustering Using Moth-Flame Optimization Algorithm. Sensors 2021, 21, 4086. https://doi.org/10.3390/s21124086

AMA Style

Singh T, Saxena N, Khurana M, Singh D, Abdalla M, Alshazly H. Data Clustering Using Moth-Flame Optimization Algorithm. Sensors. 2021; 21(12):4086. https://doi.org/10.3390/s21124086

Chicago/Turabian Style

Singh, Tribhuvan, Nitin Saxena, Manju Khurana, Dilbag Singh, Mohamed Abdalla, and Hammam Alshazly. 2021. "Data Clustering Using Moth-Flame Optimization Algorithm" Sensors 21, no. 12: 4086. https://doi.org/10.3390/s21124086

APA Style

Singh, T., Saxena, N., Khurana, M., Singh, D., Abdalla, M., & Alshazly, H. (2021). Data Clustering Using Moth-Flame Optimization Algorithm. Sensors, 21(12), 4086. https://doi.org/10.3390/s21124086

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop