Abstract
Traditional density-based clustering algorithms are sensitive to global parameter settings and struggle with datasets containing clusters of varying densities and complex shapes. In this paper, we propose O-CDBC (Optimized Connection Density-Based Clustering), a novel and efficient density-connection clustering algorithm. The core idea of O-CDBC is to introduce a compute connection density based on shared neighbors to capture complex structures, and design a data-driven mechanism for automatic outlier detection and cluster scale determination. The main optimizations include: dynamically determining the outlier ratio and minimum cluster size threshold without manual tuning. Experimental results demonstrate that O-CDBC significantly improves computational efficiency and parameter robustness while preserving strong capability in identifying clusters with complex shapes.

This publication has 16 references indexed in Scilit: