<scp>DBKIFCM–PSO</scp> : A Hybrid Approach for Optimized Clustering in Noisy and High‐Dimensional Data

ABSTRACT Fuzzy clustering algorithms have been widely used for complex data patterns and image segmentation using fuzzy partitioning. However, their performance degrades in the presence of noise and higher‐dimensional spaces. To overcome these limitations, we propose a hybrid algorithm, DBKIFCM–PSO, which combines distance‐based kernelized intuitionistic fuzzy C means clustering with particle swarm optimization. This hybrid approach addresses challenges in noisy datasets and higher‐dimensional spaces, providing optimal solutions. We compare DBKIFCM–PSO with existing algorithms on various datasets and demonstrate its superior performance. By integrating DBKIFCM and PSO, our algorithm has shown improved performance on evaluation metrics like , , and over counterpart method by obtaining best values of 0.9595, 0.1036, and −61 120, respectively, on these metrics making it suitable for real‐world applications.

Authors

Institutions

Publication Details

Journal
Internet Technology Letters
Published
2025-10-23
DOI
https://doi.org/10.1002/itl2.70157
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DBKIFCM–PSO : A Hybrid Approach for Optimized Clustering in Noisy and High‐Dimensional Data

Anjana Gosain, Kanika Bhalla
Internet Technology Letters
Advanced Clustering Algorithms Research
article

DBKIFCM–PSO : A Hybrid Approach for Optimized Clustering in Noisy and High‐Dimensional Data

Anjana Gosain, Kanika Bhalla
article en

Abstract

ABSTRACT Fuzzy clustering algorithms have been widely used for complex data patterns and image segmentation using fuzzy partitioning. However, their performance degrades in the presence of noise and higher‐dimensional spaces. To overcome these limitations, we propose a hybrid algorithm, DBKIFCM–PSO, which combines distance‐based kernelized intuitionistic fuzzy C means clustering with particle swarm optimization. This hybrid approach addresses challenges in noisy datasets and higher‐dimensional spaces, providing optimal solutions. We compare DBKIFCM–PSO with existing algorithms on various datasets and demonstrate its superior performance. By integrating DBKIFCM and PSO, our algorithm has shown improved performance on evaluation metrics like , , and over counterpart method by obtaining best values of 0.9595, 0.1036, and −61 120, respectively, on these metrics making it suitable for real‐world applications.

Internet Technology LettersVol. 8(6)
Guru Gobind Singh Indraprastha University (IN)
Openalex Percentile: Top 84%
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.