An optimized clustering algorithm based on connection density and automatic outlier detection
Open Access
- 1 April 2026
- conference paper
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 3213 (1)
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.Keywords
This publication has 16 references indexed in Scilit:
- A self-adaptive density-based clustering algorithm for varying densities datasets with strong disturbance factorData & Knowledge Engineering, 2024
- Connection density based clustering: A graph-based density clustering methodApplied Soft Computing, 2024
- MDBSCAN: A multi-density DBSCAN based on relative densityNeurocomputing, 2024
- Efficient and scalable DBSCAN framework for clustering continuous trajectories in road networksInternational Journal of Geographical Information Science, 2023
- PDCSN: A partition density clustering with self-adaptive neighborhoodsExpert Systems with Applications, 2023
- Density clustering with divergence distance and automatic center selectionInformation Sciences, 2022
- A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospectsEngineering Applications of Artificial Intelligence, 2022
- Shared-nearest-neighbor-based clustering by fast search and find of density peaksInformation Sciences, 2018
- AA-DBSCAN: an approximate adaptive DBSCAN for finding clusters with varying densitiesThe Journal of Supercomputing, 2018
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2010