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

DOI10.1007/S00357-019-09324-6MaRDI QIDQ779061zbMATH OpenOpenAlexWikidataFDO

Authors 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

clusteringalternating least squaresinterpretationcardinality constraint

Mathematics Subject Classification ID

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

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779061)