Optimal bandwidth selection for density-based clustering

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cluster analysis has long played an important role in a wide variety of data applications. When the clusters are irregular or intertwined, density-based clustering is proved to be much more efficient. The quality of clustering result depends on an adequate choice of the parameters. However, withouenough domain knowledge the parameter setting is somewhat limited in its operability. In this paper, a new method is proposed to automatically find outhe optimal parameter value of the bandwidth. It is to infer the most suitable parameter value by the constructed model on parameter estimation. Based on the Bayesian Theorem, from which the most probability value for the bandwidth can be acquired in accordance with the inherent distribution characteristics of the original data set. Clusters can then be identified by the determined parameter values. The results of the experiment show that the proposed method has complementary advantages in the density-based clustering algorithm.

Cite

CITATION STYLE

APA

Jin, H., Wang, S., Zhou, Q., & Li, Y. (2011). Optimal bandwidth selection for density-based clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6637 LNCS, pp. 156–167). Springer Verlag. https://doi.org/10.1007/978-3-642-20244-5_15

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