A variable-selection heuristic for K-means clustering
From MaRDI portal
Publication:2511838
DOI10.1007/BF02294838zbMath1293.62237MaRDI QIDQ2511838
Michael J. Brusco, J. Dennis Cradit
Publication date: 6 August 2014
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02294838
62H30: Classification and discrimination; cluster analysis (statistical aspects)
62P15: Applications of statistics to psychology
Related Items
Affinity propagation: An exemplar‐based tool for clustering in psychological research, Finite mixture models for clustering multilevel data with multiple cluster structures, Affinity propagation and uncapacitated facility location problems, KSC-N: clustering of hierarchical time profile data, A model for clustering data from heterogeneous dissimilarities, Exact and approximate algorithms for variable selection in linear discriminant analysis, Principal covariates clusterwise regression (PCCR): accounting for multicollinearity and population heterogeneity in hierarchically organized data, A modified \(k\)-means clustering procedure for obtaining a cardinality-constrained centroid matrix, Selection of variables in cluster analysis: An empirical comparison of eight procedures, A simple method for screening variables before clustering microarray data, Dealing with label switching in mixture models under genuine multimodality, Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, Modelling the role of variables in model-based cluster analysis, Initializing \(k\)-means clustering by bootstrap and data depth, Bayesian variable selection in clustering high-dimensional data with substructure, A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties, Exact methods for variable selection in principal component analysis: guide functions and pre-selection, James-Stein shrinkage to improve \(k\)-means cluster analysis, Modeling differences in the dimensionality of multiblock data by means of clusterwise simultaneous component analysis, ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses, Validating clusters with the lower bound for sum-of-squares error, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, Variable Selection for Clustering with Gaussian Mixture Models, A New Approach to Cluster Analysis: the Clustering-Function-Based Method
Uses Software
Cites Work
- Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
- Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables
- A comparison of the classification capabilities of the 1-dimensional Kohonen neural network with two partitioning and three hierarchical cluster analysis algorithms
- A study of the classification capabilities of neural networks using unsupervised learning: A comparison with \(K\)-means clustering
- Weighting and selection of variables for cluster analysis
- A Note on the Generation of Random Normal Deviates
- A Method for Comparing Two Hierarchical Clusterings
- Modeling large data sets in marketing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item