Multidimensional data clustering utilizing hybrid search strategies

DOI10.1016/0031-3203(89)90040-XzbMath0655.62068OpenAlexW1977516301MaRDI QIDQ1109461

Mohamed A. Ismail, Mohamed S. Kamel

Publication date: 1989

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(89)90040-x

zbMATH Keywords

algorithmsK-means algorithmhybrid search strategiesISODATAminimum variance clusteringmultidimensional data clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99)

Related Items

A computational study of several relocation methods for \(k\)-means algorithms. ⋮ Evolutionary radial basis functions for credit assessment ⋮ Cooperative clustering ⋮ Evolutionary radial basis functions for credit assessment ⋮ Enhanced bisecting \(k\)-means clustering using intermediate cooperation ⋮ A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks ⋮ A tabu search approach for the minimum sum-of-squares clustering problem

Cites Work

• Soft clustering of multidimensional data: A semi-fuzzy approach
• Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Printer graphics for clustering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item