Probabilistic validation approach for clustering

Authors:
M. Har-even;V. L. Brailovsky
Affiliations:
-;-
Venue:
Pattern Recognition Letters
Year:
1995

Citing 4
Cited 5

Bootstrap technique in cluster analysis

Pattern Recognition
Algorithms for clustering data

Algorithms for clustering data
A simulated annealing algorithm for the clustering problem

Pattern Recognition
A Cluster Separation Measure

IEEE Transactions on Pattern Analysis and Machine Intelligence

Evidence Accumulation Clustering Based on the K-Means Algorithm

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
k-means: a new generalized k-means clustering algorithm

Pattern Recognition Letters
Combining Multiple Clusterings Using Evidence Accumulation

IEEE Transactions on Pattern Analysis and Machine Intelligence
On Rival Penalization Controlled Competitive Learning for Clustering with Automatic Cluster Number Selection

IEEE Transactions on Knowledge and Data Engineering
A polythetic clustering process and cluster validity indexes for histogram-valued objects

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.10

Visualization

Abstract

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.