Improve Threshold Range of Canopy Clustering Using Optimization Algorithms
Asian Journal of Research in Computer Science · pp. 148–164 · Published 16 Dec 2024
10.9734/ajrcos/2024/v17i12535Abstract
Canopy clustering is an effective method for determining the number of clusters dynamically without requiring a predefined cluster count, making it particularly suitable for large and complex datasets. However, its performance is highly dependent on the manual tuning of threshold parameters T1 and T2, which can be time-consuming and inefficient. This study aims to enhance the Canopy clustering algorithm by automating the optimization of threshold ranges using intelligent optimization algorithms. We propose a novel framework that integrates Simulated Annealing (SA), Particle Swarm Optimization (PSO), and Snake Optimization (SO) to automatically determine the optimal values of T1 and T2. Additionally, to address high-dimensional data complexity, we employ dimensionality reduction techniques such as t-SNE, SNE, and Kernel Principal Component Analysis (KPCA). The silhouette coefficient is utilized as the fitness function to evaluate clustering performance. Comprehensive experiments conducted on the Wine, Iris, and MNIST Subset datasets demonstrate that the proposed optimization-based Canopy clustering framework significantly improves clustering accuracy by up to 21% on the Wine dataset and 19% on the Iris dataset compared to traditional methods. Specifically, on the Wine dataset, the optimized Canopy clustering achieved a silhouette coefficient of 0.63, a 21% improvement over the original 0.52. On the Iris dataset, the optimized method outperformed k-means and manual Canopy clustering with silhouette coefficients of 0.62 versus 0.52 and 0.55, respectively. These results highlight the effectiveness of intelligent optimization algorithms in enhancing clustering adaptability and efficiency.
References (3)
Cited by 0
No indexed citations yet.
Related research
- On Applications of Fuzzy Soft Sets in Dimension Reduction and Medical Diagnosis — shares topic coverage
- On Designing Invertible Pseudo Covariance Matrix for Undersampled Cases in Classification — shares topic coverage
- Scalable Machine Learning Algorithms for Processing High-dimensional Data: A Case Study Approach — shares topic coverage
- Local Binary Pattern and Ant Colony Optimization Based Feature Dimensionality Reduction Technique for Face Recognition Systems — shares topic coverage
- Detection of Face Recognition of Interviewee Using Transform Technique and Machinle Learning Algorithm — shares topic coverage
Article metrics
Real usage data collected on this platform.
3
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.