A modified \(k\)-means clustering procedure for obtaining a cardinality-constrained centroid matrix

DOI10.1007/s00357-019-09324-6OpenAlexW2961866709WikidataQ127495389 ScholiaQ127495389MaRDI QIDQ779061

Naoto Yamashita, Kohei Adachi

Publication date: 21 July 2020

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-019-09324-6

zbMATH Keywords

clusteringinterpretationalternating least squarescardinality constraint

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained classification: The use of a priori information in cluster analysis
• Algorithms for fuzzy clustering. Methods in \(c\)-means clustering with applications
• Selection of variables in cluster analysis: An empirical comparison of eight procedures
• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
• Joint Procrustes analysis for simultaneous nonsingular transformation of component score and loading matrices
• An index of factorial simplicity
• Probabilistic models in cluster analysis
• A new biplot procedure with joint classification of objects and variables by fuzzy \(c\)-means clustering
• Oblique rotaton in canonical correlation analysis reformulated as maximizing the generalized coefficient of determination
• A variable-selection heuristic for K-means clustering
• A Method for Comparing Two Hierarchical Clusterings
• Canonical Correlation Analysis Formulated as Maximizing Sum of Squared Correlations and Rotation of Structure Matrices

This page was built for publication: A modified \(k\)-means clustering procedure for obtaining a cardinality-constrained centroid matrix