Unsupervised Learning: Comparative Analysis of Clustering Techniques on High-Dimensional Data
원문 초록
This paper presents a comprehensive comparative analysis of prominent clustering algorithms K-means, DBSCAN, and Spectral Clustering on high-dimensional datasets. We introduce a novel evaluation framework that assesses clustering performance across multiple dimensionality reduction techniques (PCA, t-SNE, and UMAP) using diverse quantitative metrics. Experiments conducted on MNIST, Fashion-MNIST, and UCI HAR datasets reveal that preprocessing with UMAP consistently improves clustering quality across all algorithms, with Spectral Clustering demonstrating superior performance on complex manifold structures. Our findings show that algorithm selection should be guided by data characteristics, with Kmeans excelling in computational efficiency, DBSCAN in handling irregular clusters, and Spectral Clustering in capturing complex relationships. This research contributes a systematic approach for evaluating and selecting clustering techniques for high dimensional data applications.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Lightweight Model for Poultry Disease Detection from Fecal Images Using Multi-Color Space Feature Optimization and Machine Learning
Efficient Malware Detection with Optimized Learning on High-Dimensional Features
Accelerating Spectral Clustering under Fairness Constraints
Long-Range LiDAR Vehicle Detection Through Clustering and Classification for Autonomous Racing
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
CNTK: Microsoft's Open-Source Deep-Learning Toolkit
토론
이 논문과 연결된 포럼 글이 아직 없습니다.