- Daniel BarbaraAffiliated withGeorge Mason University
- , Ping ChenAffiliated withUniversity of Houston-Downtown
Self-similarity is the property of being invariant with respect to the scale used to look at the data set. Self-similarity can be measured using the fractal dimension. Fractal dimension is an important charactaristics for many complex systems and can serve as a powerful representation technique. In this chapter, we present a new clustering algorithm, based on self-similarity properties of the data sets, and also its applications to other fields in Data Mining, such as projected clustering and trend analysis. Clustering is a widely used knowledge discovery technique. The new algorithm which we call Fractal Clustering (FC) places points incrementally in the cluster for which the change in the fractal dimension after adding the point is the least. This is a very natural way of clustering points, since points in the same clusterhave a great degree of self-similarity among them (and much less self-similarity with respect to points in other clusters). FC requires one scan of the data, is suspendable at will, providing the best answer possible at that point, and is incremental. We show via experiments that FC effectively deals with large data sets, high-dimensionality and noise and is capable of recognizing clusters of arbitrary shape.
Keywordsself-similarity clustering projected clustering trend analysis
- Fractal Mining
- Book Title
- Data Mining and Knowledge Discovery Handbook
- Book Part
- pp 627-647
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, Inc.
- Additional Links
- projected clustering
- trend analysis
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.