Pages that link to "Item:Q2511838"
From MaRDI portal
The following pages link to A variable-selection heuristic for K-means clustering (Q2511838):
Displayed 16 items.
- Exact and approximate algorithms for variable selection in linear discriminant analysis (Q452539) (← links)
- Selection of variables in cluster analysis: An empirical comparison of eight procedures (Q946679) (← links)
- A simple method for screening variables before clustering microarray data (Q961706) (← links)
- Dealing with label switching in mixture models under genuine multimodality (Q1006666) (← links)
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm (Q1023820) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- Bayesian variable selection in clustering high-dimensional data with substructure (Q2259948) (← links)
- A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties (Q2353148) (← links)
- James-Stein shrinkage to improve \(k\)-means cluster analysis (Q2445666) (← links)
- Modeling differences in the dimensionality of multiblock data by means of clusterwise simultaneous component analysis (Q2452352) (← links)
- ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses (Q2483823) (← links)
- Validating clusters with the lower bound for sum-of-squares error (Q2517864) (← links)
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
- Variable Selection for Clustering with Gaussian Mixture Models (Q3183203) (← links)
- A New Approach to Cluster Analysis: the Clustering-Function-Based Method (Q3408543) (← links)
- Affinity propagation and uncapacitated facility location problems (Q5964469) (← links)