k-means++

swMATH21622MaRDI QIDQ33424FDOQ33424

Author name not available (Why is that?)

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

• Robust Bregman 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
• Maximum likelihood estimation of Gaussian mixture models using stochastic search
• Clustering stability-based evolutionary K-means
• Point clustering via voting maximization
• An improved primal-dual approximation algorithm for the \(k\)-means problem with penalties
• Discovering recurring activity in temporal networks
• Tight lower bound instances for \(k\)-means++ in two dimensions
• Robust discriminative clustering with sparse regularizers
• A refined approximation for Euclidean \(k\)-means
• Failure probability estimation of linear time varying systems by progressive refinement of reduced order models
• 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
• 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
• 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
• Analysing microarray expression data through effective clustering
• Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method
• \(k\)-means++ under approximation stability
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
• The alternating descent conditional gradient method for sparse inverse problems
• Surface estimation for multiple misaligned point sets
• Binary whale optimization algorithm and binary moth flame optimization with clustering algorithms for clinical breast cancer diagnoses
• An ensemble feature ranking algorithm for clustering analysis
• Improving a centroid-based clustering by using suitable centroids from another clustering
• Deep learning and k-means clustering in heterotic string vacua with line bundles
• An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
• Smoothed analysis of probabilistic roadmaps
• Scalable Bayesian preference learning for crowds
• Orphan-free anisotropic Voronoi diagrams
• Fuzzy clustering: more than just fuzzification
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics
• Equi-Clustream: a framework for clustering time evolving mixed data
• NP-hardness of Euclidean sum-of-squares clustering
• k-POD: A Method for k-Means Clustering of Missing Data
• Title not available (Why is that?)
• Sparsity-inducing variational shape partitioning
• Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
• Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
• A family of unsupervised sampling algorithms
• A framework to uncover multiple alternative clusterings
• An efficient \(K\)-means clustering algorithm for tall data
• A clustering method for data in cylindrical coordinates
• Variational image restoration and segmentation with Rician noise
• Geometric optimization in machine learning
• On smoothed analysis of quicksort and Hoare's find
• Local versions of sum-of-norms clustering
• Joint optimization of an autoencoder for clustering and embedding
• 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
• Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
• Title not available (Why is that?)
• A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
• 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
• BICO: BIRCH meets coresets for \(k\)-means clustering
• 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
• Latent simplex position model: high dimensional multi-view clustering with uncertainty quantification
• 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

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