An improved DBSCAN algorithm based on cell-like P systems with promoters and inhibitors

9Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Density-based spatial clustering of applications with noise (DBSCAN) algorithm can find clusters of arbitrary shape, while the noise points can be removed. Membrane computing is a novel research branch of bio-inspired computing, which seeks to discover new computational models/framework from biological cells. The obtained parallel and distributed computing models are usually called P systems. In this work, DBSCAN algorithm is improved by using parallel evolution mechanism and hierarchical membrane structure in cell-like P systems with promoters and inhibitors, where promoters and inhibitors are utilized to regulate parallelism of objects evolution. Experiment results show that the proposed algorithm performs well in big cluster analysis. The time complexity is improved to O(n), in comparison with conventional DBSCAN of O(n 2 ). The results give some hints to improve conventional algorithms by using the hierarchical framework and parallel evolution mechanism in membrane computing models.

Cite

CITATION STYLE

APA

Zhao, Y., Liu, X., & Li, X. (2018). An improved DBSCAN algorithm based on cell-like P systems with promoters and inhibitors. PLoS ONE, 13(12). https://doi.org/10.1371/journal.pone.0200751

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free