An efficient fractal dimension based clustering algorithm

Xiao Xiong; Jie Zhang; Qingwei Shi

doi:10.1117/12.752680

10 September 2007 An efficient fractal dimension based clustering algorithm

Xiao Xiong, Jie Zhang, Qingwei Shi

Proceedings Volume 6773, Next-Generation Communication and Sensor Networks 2007; 67730T (2007) https://doi.org/10.1117/12.752680
Event: Optics East, 2007, Boston, MA, United States

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.

Citation Download Citation

Xiao Xiong, Jie Zhang, and Qingwei Shi "An efficient fractal dimension based clustering algorithm", Proc. SPIE 6773, Next-Generation Communication and Sensor Networks 2007, 67730T (10 September 2007); https://doi.org/10.1117/12.752680

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available