A modified k-means clustering procedure for obtaining a cardinality-constrained centroid matrix
From MaRDI portal
Publication:779061
DOI10.1007/S00357-019-09324-6OpenAlexW2961866709WikidataQ127495389 ScholiaQ127495389MaRDI QIDQ779061FDOQ779061
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
Cites Work
- Probabilistic models in cluster analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Method for Comparing Two Hierarchical Clusterings
- Algorithms for fuzzy clustering. Methods in \(c\)-means clustering with applications
- A variable-selection heuristic for K-means clustering
- Constrained classification: The use of a priori information in cluster analysis
- Selection of variables in cluster analysis: An empirical comparison of eight procedures
- Joint Procrustes analysis for simultaneous nonsingular transformation of component score and loading matrices
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
- An index of factorial simplicity
- 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
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779061)
