k-means++

swMATH21622MaRDI QIDQ33424FDOQ33424

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• A framework to uncover multiple alternative clusterings
• An efficient \(K\)-means clustering algorithm for tall data
• A clustering method for data in cylindrical coordinates
• A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering
• Variational image restoration and segmentation with Rician noise
• On smoothed analysis of quicksort and Hoare's find
• Joint optimization of an autoencoder for clustering and embedding
• Title not available (Why is that?)
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• Balanced \(k\)-means clustering on an adiabatic quantum computer
• Probably certifiably correct \(k\)-means clustering
• Analytical and Numerical Evaluation of the Suppressed Fuzzy C-Means Algorithm
• Clustering by quantum annealing on the three-level quantum elements qutrits
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• A GFEM-based reduced-order homogenization model for heterogeneous materials under volumetric and interfacial damage
• Approximation algorithms for spherical \(k\)-means problem using local search scheme
• Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
• Title not available (Why is that?)
• Geometric Optimization in Machine Learning
• Approximate Clustering with Same-Cluster Queries
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
• Lagrange dual bound computation for stochastic service network design
• Comparison of internal clustering validation indices for prototype-based clustering
• Angle-based models for ranking data
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
• A spectral algorithm with additive clustering for the recovery of overlapping communities in networks
• Stochastic optimization for network-constrained power system scheduling problem
• Bayesian optimization with approximate set kernels
• Interpretable clustering: an optimization approach
• Quick-means: accelerating inference for K-means by learning fast transforms
• Big data time series forecasting based on pattern sequence similarity and its application to the electricity demand
• Data clustering via cooperative games: a novel approach and comparative study
• An incremental density-based clustering framework using fuzzy local clustering
• Compositional convolutional neural networks: a robust and interpretable model for object recognition under occlusion
• Objective function-based rough membership C-means clustering
• Consensus rate-based label propagation for semi-supervised classification
• Three kinds of discrete approximations of statistical multivariate distributions and their applications
• Partial recovery bounds for clustering with the relaxed \(K\)-means
• An Initialization Method Based on Hybrid Distance for k-Means Algorithm
• Implicit consensus clustering from multiple graphs
• A Riemannian Newton trust-region method for fitting Gaussian mixture models
• An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization
• Randomization methods for assessing data analysis results on real‐valued matrices
• 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
• Phase distribution and properties identification of heterogeneous materials: a data-driven approach
• A multiscale environment for learning by diffusion
• BICO: BIRCH Meets Coresets for k-Means Clustering
• Sampling-based dimension reduction for subspace approximation with outliers
• Simplification and hierarchical representations of mixtures of exponential families
• Clustering on the torus by conformal prediction
• Local Versions of Sum-of-Norms Clustering
• Clustering with or without the approximation
• Approximation algorithms for fuzzy \(C\)-means problem based on seeding method
• Hierarchical means clustering
• Size matters: choosing the most informative set of window lengths for mining patterns in event sequences
• Adaptive initialization method based on spatial local information for \(k\)-means algorithm
• Title not available (Why is that?)
• Robust Bregman clustering
• Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method
• Generalized \(k\)-means in GLMs with applications to the outbreak of COVID-19 in the United States
• Unsupervised image segmentation with Gaussian pairwise Markov fields
• Maximum likelihood estimation of Gaussian mixture models using stochastic search
• Clustering stability-based evolutionary K-means
• Point clustering via voting maximization
• Discovering recurring activity in temporal networks
• Tight lower bound instances for \(k\)-means++ in two dimensions
• A refined approximation for Euclidean \(k\)-means
• A bad instance for \texttt{k-means++}
• The planar \(k\)-means problem is NP-hard
• Two-stage portfolio optimization with higher-order conditional measures of risk
• Bayesian nonparametric priors for hidden Markov random fields
• A Family of Unsupervised Sampling Algorithms
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• \(k\)-means requires exponentially many iterations even in the plane
• An approximation ratio for biclustering
• Texture segmentation using independent-scale component-wise Riemannian-covariance Gaussian mixture model in KL measure based multi-scale nonlinear structure tensor space
• Differential algebra-based multiple Gaussian particle filter for orbit determination
• Model-free inference of diffusion networks using RKHS embeddings
• The Planar k-Means Problem is NP-Hard
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems
• Compressive statistical learning with random feature moments
• Statistical learning guarantees for compressive clustering and compressive mixture modeling
• Non-local spatially varying finite mixture models for image segmentation
• Approximation algorithms for tensor clustering
• Consolidating home meal delivery with limited operational disruption
• Solution path clustering with adaptive concave penalty
• A rough-and-ready cluster-based approach for extracting finite-time coherent sets from sparse and incomplete trajectory data
• Pro-active real-time routing in applications with multiple request patterns
• Extreme clustering -- a clustering method via density extreme points
• Unsupervised learning by cluster quality optimization
• An overview of multiple sequence alignments and cloud computing in bioinformatics
• Minimax and Minimax Projection Designs Using Clustering
• A quantization framework for smoothed analysis of Euclidean optimization problems
• K-means clustering via a nonconvex optimization approach
• Automatic liver segmentation on volumetric CT images using supervoxel-based graph cuts
• A method for K-means seeds generation applied to text mining
• Strategyproof facility location for concave cost functions
• Cross-entropy clustering

This page was built for software: k-means++