swMATH21622MaRDI QIDQ33424FDOQ33424
Author name not available (Why is that?)
Official website: https://dl.acm.org/doi/10.5555/1283383.1283494
Cited In (only showing first 100 items - show all)
- Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study
- Title not available (Why is that?)
- A unified framework for clustering constrained data without locality property
- Heterogeneous distributed big data clustering on sparse grids
- Temporal clustering
- PolyStress
- 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
- Model-based hierarchical clustering with Bregman divergences and Fishers mixture model: application to depth image analysis
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem
- Learning 3D semantic scene graphs with instance embeddings
- Sparse convex hull coverage
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Initializing \(k\)-means clustering by bootstrap and data depth
- On strategies to fix degenerate \(k\)-means solutions
- Approximating spectral clustering via sampling: a review
- 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
- Automated knowledge-assisted mitosis cells detection framework in breast histopathology images
- Embedding-based silhouette community detection
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Classification and prediction of bulk densities of states and chemical attributes with machine learning techniques
- Efficient binary embedding of categorical data using BinSketch
- Minimum density hyperplanes
- Hybrid Wasserstein distance and fast distribution clustering
- Title not available (Why is that?)
- Learning what is where from unlabeled images: joint localization and clustering of foreground objects
- Efficient dynamic hedging for large variable annuity portfolios with multiple underlying assets
- Fast indefinite multi-point (IMP) clustering
- Non-convex clustering via proximal alternating linearized minimization method
- Noisy, Greedy and Not so Greedy k-Means++
- Improvement of the fast clustering algorithm improved by \(K\)-means in the big data
- A clustering approach to constrained binary matrix factorization
- Model assisted variable clustering: minimax-optimal recovery and algorithms
- Implicit consensus clustering from multiple graphs
- A Riemannian Newton trust-region method for fitting Gaussian mixture models
- Efficient simulation designs for valuation of large variable annuity portfolios
- An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization
- Topology: a theory of a pseudometric-based clustering model and its application in content-based image retrieval
- Clustered exact Daum-Huang particle flow filter
- 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
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- Clustering on the torus by conformal prediction
- Title not available (Why is that?)
- Data-driven modeling of the temporal evolution of breakers' states in the French electrical transmission grid
- An extension of K-means for least-squares community detection in feature-rich networks
- Dissecting graph measure performance for node clustering in LFR parameter space
- Greedy minimization of weakly supermodular set functions
- Robust Bregman clustering
- clusterpath
- pyhrt
- MOGWO
- 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
- ClusterGAN
- 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
- Graclus
- Texture segmentation using independent-scale component-wise Riemannian-covariance Gaussian mixture model in KL measure based multi-scale nonlinear structure tensor space
- 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
- 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
- An overview of multiple sequence alignments and cloud computing in bioinformatics
- 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
- RGCNN
- COOLCAT
- DaisyRec
- FGKA
- DILS
- GuidedSparseKmeans
- drums
- pygmsh
- DatabionicSwarm
This page was built for software: k-means++
