A variable-selection heuristic for K-means clustering

DOI10.1007/BF02294838zbMath1293.62237OpenAlexW2044436985MaRDI 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

zbMATH Keywords

heuristicscluster analysisvariable selectionK-means partitioning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to psychology (62P15)

Related Items (25)

Exact methods for variable selection in principal component analysis: guide functions and pre-selection ⋮ KSC-N: clustering of hierarchical time profile data ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ Variable Selection for Clustering with Gaussian Mixture Models ⋮ Modelling the role of variables in model-based cluster analysis ⋮ Exact and approximate algorithms for variable selection in linear discriminant analysis ⋮ James-Stein shrinkage to improve \(k\)-means cluster analysis ⋮ Affinity propagation: An exemplar‐based tool for clustering in psychological research ⋮ Modeling differences in the dimensionality of multiblock data by means of clusterwise simultaneous component analysis ⋮ Initializing \(k\)-means clustering by bootstrap and data depth ⋮ Selection of variables in cluster analysis: An empirical comparison of eight procedures ⋮ Principal covariates clusterwise regression (PCCR): accounting for multicollinearity and population heterogeneity in hierarchically organized data ⋮ A simple method for screening variables before clustering microarray data ⋮ ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses ⋮ Bayesian variable selection in clustering high-dimensional data with substructure ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Validating clusters with the lower bound for sum-of-squares error ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning ⋮ Dealing with label switching in mixture models under genuine multimodality ⋮ Finite mixture models for clustering multilevel data with multiple cluster structures ⋮ Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm ⋮ A New Approach to Cluster Analysis: the Clustering-Function-Based Method ⋮ A modified \(k\)-means clustering procedure for obtaining a cardinality-constrained centroid matrix ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis ⋮ A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties

Uses Software

• OVWTRE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A variable-selection heuristic for K-means clustering