10 September 2007 An efficient fractal dimension based clustering algorithm
Author Affiliations +
Abstract
Clustering plays an important role in data mining. It helps to reveal intrinsic structure in data sets with little or no prior knowledge. The approaches of clustering have received great attention in recent years. However many published algorithms fail to do well in determining the number of cluster, finding arbitrary shapes of clusters or identifying the presence of noise. In this paper we present an efficient clustering algorithm which employs the theory of grid, density and fractal that can partition points in the same cluster with minimum change of fractal dimension meanwhile maximizing the self-similarity in the clusters. We show via experiments that FDC can quickly deal with multidimensional large data sets, identify the number of clusters, be capable of recognizing clusters of arbitrary shape and furthermore explore some qualitative information from data sets.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiao Xiong, Jie Zhang, Qingwei Shi, "An efficient fractal dimension based clustering algorithm", Proc. SPIE 6773, Next-Generation Communication and Sensor Networks 2007, 67730T (10 September 2007); doi: 10.1117/12.752680; https://doi.org/10.1117/12.752680
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

Fast algorithm for entropy estimation
Proceedings of SPIE (May 29 2013)
Color constancy using fractals
Proceedings of SPIE (March 11 2005)
A temporal algorithm for IR small targets detection
Proceedings of SPIE (January 11 2007)

Back to Top