Probabilistic validation approach for clustering

The suggested approach combines the phases of cluster validity and cluster tendency inside the scope of the clustering algorithm. The algorithm is based on a probabilistic approach and is invariant to the scaling of features. The result is an efficient algorithm whose performance is demonstrated on real and synthetic data.

[1]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[2]  Victor L. Brailovsky,et al.  A probabilistic approach to clustering , 1991, Pattern Recognit. Lett..

[3]  Shokri Z. Selim,et al.  A simulated annealing algorithm for the clustering problem , 1991, Pattern Recognit..

[4]  J. Friedman.  Exploratory Projection Pursuit , 1987 .

[5]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[7]  J. Hartigan,et al.  Percentage Points of a Test for Clusters , 1969 .

[8]  Anil K. Jain,et al.  Bootstrap technique in cluster analysis , 1987, Pattern Recognit..