EUVIMEDEUVIMED entdecken
Crossref

Adaptive and Robust DBSCAN With Multi-Agent Reinforcement Learning

Hao Peng, Xiang Huang, Shuo Sun, Ruitong Zhang, Xizhao Wang, Philip S Yu

IEEE Transactions on Pattern Analysis and Machine Intelligence · 2026-04 · 48 (4) · 4860-4877

DOI: 10.1109/tpami.2025.3648017 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Pattern Analysis and Machine Intelligence, 2026-04. Verfasst von Hao Peng und 5 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 66 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Beijing Natural Science Foundation, Pioneer and Leading Goose R&D Program of Zhejiang.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Density-Based Spatial Clustering of Applications with Noise (DBSCAN), a well-known density-based clustering algorithm, has gained widespread popularity and usage due to its effectiveness in identifying clusters of arbitrary shapes and handling noisy data. However, it encounters challenges in producing satisfactory cluster results when confronted with datasets of varying density scales, a common scenario in real-world applications. In this paper, we propose a novel Adaptive and Robust DBSCAN with Multi-agent Reinforcement Learning cluster framework, namely AR-DBSCAN. First, we model the initial dataset as a two-level encoding tree and categorize the data vertices into distinct density partitions according to the information uncertainty determined in the encoding tree. Each partition is then assigned to an agent to find the best clustering parameters without manual assistance. The allocation is density-adaptive, enabling AR-DBSCAN to effectively handle diverse density distributions within the dataset by utilizing distinct agents for different partitions. Second, a multi-agent deep reinforcement learning guided automatic parameter searching process is designed. The process of adjusting the parameter search direction by perceiving the clustering environment is modeled as a Markov decision process. Using a weakly-supervised reward training policy network, each agent adaptively learns the optimal clustering parameters by interacting with the clusters. Third, a recursive search mechanism adaptable to the data's scale is presented, enabling efficient and controlled exploration of large parameter spaces. Extensive experiments are conducted on nine artificial datasets and a real-world dataset. The results of offline and online tasks show that AR-DBSCAN not only improves clustering accuracy by up to 144.1% and 175.3% in the Normalized Mutual Information (NMI) and the Adjusted Rand Index (ARI) metrics, respectively, but also is capable of robustly finding dominant parameters.

Förderung

  • National Natural Science Foundation of China
  • Beijing Natural Science Foundation
  • Pioneer and Leading Goose R&D Program of Zhejiang
  • Local Science and Technology Development Fund of Hebei Province Guided by the Central Government of China
  • National Key Laboratory
  • Natural Science Foundation of Hebei Province
  • Major Science Technology Special Projects of Yunnan Province
  • Fundamental Research Funds for the Central Universities

Zitieren

APA

Peng, H., Huang, X., Sun, S., Zhang, R., Wang, X., & Yu, P. S. (2026). Adaptive and Robust DBSCAN With Multi-Agent Reinforcement Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 48(4), 4860-4877. https://doi.org/10.1109/tpami.2025.3648017

Vancouver

Peng H, Huang X, Sun S, Zhang R, Wang X, Yu PS. Adaptive and Robust DBSCAN With Multi-Agent Reinforcement Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2026;48(4):4860-4877. doi:10.1109/tpami.2025.3648017

BibTeX
@article{Peng2026,
  author = {Peng, Hao and Huang, Xiang and Sun, Shuo and Zhang, Ruitong and Wang, Xizhao and Yu, Philip S},
  title = {Adaptive and Robust DBSCAN With Multi-Agent Reinforcement Learning},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {2026},
  volume = {48},
  number = {4},
  pages = {4860--4877},
  doi = {10.1109/tpami.2025.3648017}
}
Kostenlos starten →