Maximin initialization for cluster analysis

Authors:
Richard J. Hathaway;James C. Bezdek;Jacalyn M. Huband
Affiliations:
Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA;Computer Science Department, University of West Florida, Pensacola, FL;Computer Science Department, University of West Florida, Pensacola, FL
Venue:
CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
Year:
2006

Citing 7
Cited 0

Multidimensional similarity structure analysis

Multidimensional similarity structure analysis
On relational data versions of c-means algorithms

Pattern Recognition Letters - Special issue on fuzzy set technology in pattern recognition
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing

Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Convergence of alternating optimization

Neural, Parallel & Scientific Computations
Approximate clustering in very large relational data: Research Articles

International Journal of Intelligent Systems
Scalable visual assessment of cluster tendency for large data sets

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most iterative clustering algorithms require a good initialization to achieve accurate results. A new initialization procedure for all such algorithms is given that is exact when the data contain compact, separated clusters. Our examples use c-means clustering.