Using Cluster Similarity to Detect Natural Cluster Hierarchies

  • Authors:
  • GuangHui Yan;ZhanHuai Li

  • Affiliations:
  • Northwestern Polytechnical University, Xi'an 710072, P.R. China;Northwestern Polytechnical University, Xi'an 710072, P.R. China

  • Venue:
  • FSKD '07 Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clustering is the process of partitioning a set of patterns into disjoint and homogeneous meaningful groups (clusters) among which there exist more or less similarities and hi- erarchies. Accordingly, customer will have difficult to in- terpret and describe these large amounts of initial cluster results and hierarchies among them. Therefore, it is very valuable to analyze these similarities and construct hier- archy structures of the cluster results based on the sim- ilarities. The statistical cluster methods, the grid-based and density-based cluster methods and the model-based cluster algorithms are unfit for this post-processing cluster problem. Furthermore, this problem becomes more intri- cate in data stream environment for the constraint of single scan of stream data and the need of incremental cluster- ing. Based on multifractal theory, the Fractal-based Clus- ter Hierarchy Optimization (FCHO) algorithm is proposed, which integrate the cluster similarity with the cluster shape and the cluster distribution to construct cluster hierarchy tree from the disjoint initial clusters. The algorithm pro- posed is easy to realize, simple to understand and parame- ter self-adaptive. The elementary time-space complexity is presented and the experimental results using synthetic and real life data set show the performance and the effectivity of FCHO algorithm.