Cited in
(only showing first 100 items - show all)- Robust Bregman clustering
- Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study
- An efficient \(K\)-means clustering algorithm for tall data
- A framework to uncover multiple alternative clusterings
- A unified framework for clustering constrained data without locality property
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- Heterogeneous distributed big data clustering on sparse grids
- Temporal clustering
- 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
- Reduction of multivariate mixtures and its applications
- \(k\)-means genetic algorithms with greedy genetic operators
- Switching behaviour in vascular smooth muscle cell-matrix adhesion during oscillatory loading
- A clustering method for data in cylindrical coordinates
- Maximum likelihood estimation of Gaussian mixture models using stochastic search
- Applied multivariate statistical analysis
- Model-based hierarchical clustering with Bregman divergences and Fishers mixture model: application to depth image analysis
- Clustering stability-based evolutionary K-means
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem
- Point clustering via voting maximization
- Optimizing MSE for clustering with balanced size constraints
- Variational image restoration and segmentation with Rician noise
- Mean-field theory of graph neural networks in graph partitioning
- Application to IoT network control: predictive network control based on real-world information
- Geometric optimization in machine learning
- Learning 3D semantic scene graphs with instance embeddings
- On smoothed analysis of quicksort and Hoare's find
- Sparse convex hull coverage
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Joint optimization of an autoencoder for clustering and embedding
- Tight lower bound instances for k-means++ in two dimensions
- Local versions of sum-of-norms clustering
- An improved primal-dual approximation algorithm for the \(k\)-means problem with penalties
- Discovering recurring activity in temporal networks
- A bad instance for \texttt{k-means++}
- A refined approximation for Euclidean \(k\)-means
- Robust discriminative clustering with sparse regularizers
- Initializing \(k\)-means clustering by bootstrap and data depth
- The planar \(k\)-means problem is NP-hard
- Online trans-dimensional von Mises-Fisher mixture models for user profiles
- Failure probability estimation of linear time varying systems by progressive refinement of reduced order models
- The seeding algorithm for spherical \(k\)-means clustering with penalties
- Two-stage portfolio optimization with higher-order conditional measures of risk
- Balanced \(k\)-means clustering on an adiabatic quantum computer
- Bayesian nonparametric priors for hidden Markov random fields
- A shift selection strategy for parallel shift-invert spectrum slicing in symmetric self-consistent eigenvalue computation
- Probably certifiably correct k-means clustering
- On strategies to fix degenerate \(k\)-means solutions
- Automated knowledge-assisted mitosis cells detection framework in breast histopathology images
- Nonrigid registration using Gaussian processes and local likelihood estimation
- Curve approximation by \(G^1\) arc splines with a limited number of types of curvature and length
- Approximating spectral clustering via sampling: a review
- Analytical and Numerical Evaluation of the Suppressed Fuzzy C-Means Algorithm
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
- Embedding-based silhouette community detection
- \(k\)-means requires exponentially many iterations even in the plane
- Texture segmentation using independent-scale component-wise Riemannian-covariance Gaussian mixture model in KL measure based multi-scale nonlinear structure tensor space
- An approximation ratio for biclustering
- Clustering by quantum annealing on the three-level quantum elements qutrits
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Efficient binary embedding of categorical data using BinSketch
- Classification and prediction of bulk densities of states and chemical attributes with machine learning techniques
- A GFEM-based reduced-order homogenization model for heterogeneous materials under volumetric and interfacial damage
- Distributed consensus-based \(K\)-means algorithm in switching multi-agent networks
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- Local search yields a PTAS for \(k\)-means in doubling metrics
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Differential algebra-based multiple Gaussian particle filter for orbit determination
- Minimum density hyperplanes
- Training Gaussian mixture models at scale via coresets
- Hybrid Wasserstein distance and fast distribution clustering
- Model-free inference of diffusion networks using RKHS embeddings
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- scientific article; zbMATH DE number 7370572 (Why is no real title available?)
- scientific article; zbMATH DE number 7378621 (Why is no real title available?)
- The Planar k-Means Problem is NP-Hard
- Learning what is where from unlabeled images: joint localization and clustering of foreground objects
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- scientific article; zbMATH DE number 7278033 (Why is no real title available?)
- Consolidating home meal delivery with limited operational disruption
- 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
- Fast indefinite multi-point (IMP) clustering
- Efficient dynamic hedging for large variable annuity portfolios with multiple underlying assets
- Approximate Clustering with Same-Cluster Queries
- Solution path clustering with adaptive concave penalty
- scientific article; zbMATH DE number 7306918 (Why is no real title available?)
- The fast clustering algorithm for the big data based on K-means
- MONC
- REPSN
- CometBoards
- PcGets
- J-MEANS
- CLUES
- RFCM
- EPCM
- Silhouettes
- MOCK
This page was built for software: k-means++
