Algorithm AS 136: A K-Means Clustering Algorithm
From MaRDI portal
Cited in
(only showing first 100 items - show all)- PK-means: A new algorithm for gene clustering
- A toolbox for \(K\)-centroids cluster analysis
- K-hyperline clustering learning for sparse component analysis
- The importance of the scales in heterogeneous robust clustering
- CLUES: a non-parametric clustering method based on local shrinking
- Assessing agreement of clustering methods with gene expression microarray data
- Exemplar-based clustering via simulated annealing
- Principal point classification: applications to differentiating drug and placebo responses in longitudinal studies
- A graph b-coloring framework for data clustering
- A global algorithm to estimate the expectations of the components of an observed univariate mixture
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- A novel fuzzy clustering algorithm using observation weighting and context information for reverberant blind speech separation
- RHclust
- Asymptotic properties of univariate sample k-means clusters
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Clusteranalyse - Überblick und neuere Entwicklungen
- Robust mixture modeling based on scale mixtures of skew-normal distributions
- Model-based clustering of time series in group-specific functional subspaces
- Mixtures of multivariate power exponential distributions
- An extension of the \(p\)-median group technology algorithm
- Model-based clustering of multivariate ordinal data relying on a stochastic binary search algorithm
- Variable selection for model-based clustering using the integrated complete-data likelihood
- Cluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minima
- Radial basis functions for exploratory data analysis: An iterative majorisation approach for Minkowski distances based on multidimensional scaling
- A comparison of the classification capabilities of the 1-dimensional Kohonen neural network with two partitioning and three hierarchical cluster analysis algorithms
- Integrating robust clustering techniques in S-PLUS
- A semiparametric method for clustering mixed data
- Flexible nonhomogeneous Markov models for panel observed data
- Feature screening in large scale cluster analysis
- Fast estimation of posterior probabilities in change-point analysis through a constrained hidden Markov model
- Quantum annealing for combinatorial clustering
- Clustering longitudinal profiles using P-splines and mixed effects models applied to time-course gene expression data
- A survey of functional principal component analysis
- Flexible clustering via extended mixtures of common \(t\)-factor analyzers
- Mixtures of common t-factor analyzers for modeling high-dimensional data with missing values
- Bayesian cluster analysis: point estimation and credible balls (with discussion)
- A spatio-temporal modeling framework for weather radar image data in tropical southeast Asia
- Variable selection for high-dimensional genomic data with censored outcomes using group Lasso prior
- Spatial data compression via adaptive dispersion clustering
- Angle-based models for ranking data
- Advances in artificial neural networks -- methodological development and application
- Clustering using an improved krill herd algorithm
- Optimal projection of observations in a Bayesian setting
- Experiments on individual strategy updating in iterated snowdrift game under random rematching
- Discriminative clustering via extreme learning machine
- A hybrid algorithm with cluster analysis in modelling high dimensional data
- Dynamic tail dependence clustering of financial time series
- A novel probabilistic clustering model for heterogeneous networks
- TRANSFORM-ANN for online optimization of complex industrial processes: casting process as case study
- A semiparametric and location-shift copula-based mixture model
- Variance-based cluster selection criteria in a \(K\)-means framework for one-mode dissimilarity data
- A unified approach to functional principal component analysis and functional multiple-set canonical correlation
- Cluster analysis of longitudinal profiles with subgroups
- Vine copula approximation: a generic method for coping with conditional dependence
- Multi-period classification: learning sequent classes from temporal domains
- Optimized assignment patterns in mobile edge cloud networks
- A mixed-integer programming approach to GRNN parameter estimation
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
- Pattern layer reduction for a generalized regression neural network by using a self-organizing map
- Machine learning core inflation
- Spatiotemporal extended fuzzy C-means clustering algorithm for hotspots detection and prediction
- Cluster forests
- Numerical studies of MacQueen's k-means algorithm for computing the centroidal Voronoi tessellations
- Visualizing non-hierarchical and hierarchical cluster analysis with clustergrams
- The Kohonen self-organizing map method: An assessment
- On endmember identification in hyperspectral images without pure pixels: a comparison of algorithms
- Performance of protein-ligand docking with CDK4/6 inhibitors: a case study
- Mixtures of restricted skew-t factor analyzers with common factor loadings
- A fuzzy edge-weighted centroidal Voronoi tessellation model for image segmentation
- Community detection in node-attributed social networks: a survey
- A variational approximations-DIC rubric for parameter estimation and mixture model selection within a family setting
- Robust detection of neural spikes using sparse coding based features
- Quick-means: accelerating inference for K-means by learning fast transforms
- Weighted co-association rate-based Laplacian regularized label description for semi-supervised regression
- Accelerating sequential Monte Carlo with surrogate likelihoods
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Mixtures of factor analyzers with covariates for modeling multiply censored dependent variables
- Efficient two-scale analysis with thermal residual stresses and strains based on self-consistent clustering analysis
- Scalable computational measures for entropic detection of latent relations and their applications to magnetic imaging
- Network embedding: taxonomies, frameworks and applications
- On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling
- An empirical comparison between stochastic and deterministic centroid initialisation for K-means variations
- K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means
- Wavelet multidimensional scaling analysis of European economic sentiment indicators
- Versatile uncertainty quantification of contrastive behaviors for modeling networked anagram games
- Dynamics of macroscopic diffusion across meta-populations with top-down and bottom-up approaches: a review
- Clustering and representation of time series. Application to dissimilarities based on divergences
- Combined relevance vector machine technique and subset simulation importance sampling for structural reliability
- A Bayesian approach to model individual differences and to partition individuals: case studies in growth and learning curves
- Data clustering based on the modified relaxation Cheeger cut model
- Robust clustering of multiply censored data via mixtures of \(t\) factor analyzers
- High-dimensional clustering via random projections
- Bayesian sparse convex clustering via global-local shrinkage priors
- KM-MIC: an improved maximum information coefficient based on K-medoids clustering
- An image segmentation method based on network clustering model
- A soft computing model based on asymmetric Gaussian mixtures and Bayesian inference
- Neighborhood density information in clustering
- Benchmarking penalized regression methods in machine learning for single cell RNA sequencing data
- Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering
This page was built for publication: Algorithm AS 136: A K-Means Clustering Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q105416)
