25 October 2016 An automatic clustering algorithm based on DB criterion
Author Affiliations +
Proceedings Volume 10157, Infrared Technology and Applications, and Robot Sensing and Advanced Control; 101570P (2016) https://doi.org/10.1117/12.2244641
Event: International Symposium on Optoelectronic Technology and Application 2016, 2016, Beijing, China
Abstract
Inspired by a recent algorithm on clustering, we proposed an improved algorithm which combines the Davies Bouldin criterion to obtain the right number of the cluster centers automatically and output the right clusters. Davies-Bouldin criterion can describe the intra-class scatter and inter-class deviation value of the clustering result. In our algorithm, we first calculate the density and the distance of the sample points, which contain the information of the density distribution leading to the right clusters; Then, we choose two thresholds of the density and the distance to obtain the maximum number of the cluster centers; Finally, our algorithm automatically searches the right number of cluster centers through calculating the Davies-Bouldin value of every clustering result and choose the one which has the minimum Davies-Bouldin value. Experiments show that our algorithm can not only output the right clustering result when the sample points are disturbed and with special density distribution, but can also obtain the right number of the cluster centers automatically.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Feng Zhang, Feng Zhang, Wei-ping Yang, Wei-ping Yang, Zhi-long Zhang, Zhi-long Zhang, Shu-xin Zhang, Shu-xin Zhang, Xin Ye, Xin Ye, Jun-jun Zhang, Jun-jun Zhang, } "An automatic clustering algorithm based on DB criterion ", Proc. SPIE 10157, Infrared Technology and Applications, and Robot Sensing and Advanced Control, 101570P (25 October 2016); doi: 10.1117/12.2244641; https://doi.org/10.1117/12.2244641
PROCEEDINGS
8 PAGES


SHARE
Back to Top