scientific article; zbMATH DE number 5506203
From MaRDI portal
Publication:3601533
Cited in
(23)- An approximation algorithm for the uniform capacitated \(k\)-means problem
- The seeding algorithm for spherical \(k\)-means clustering with penalties
- A refined approximation for Euclidean \(k\)-means
- ABBA: adaptive Brownian bridge-based symbolic aggregation of time series
- Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study
- Clustering with or without the approximation
- Using expert's rules as background knowledge in the ClusDM methodology
- Balanced \(k\)-means clustering on an adiabatic quantum computer
- Tight lower bound instances for k-means++ in two dimensions
- The Planar k-Means Problem is NP-Hard
- The planar \(k\)-means problem is NP-hard
- Local search yields a PTAS for \(k\)-means in doubling metrics
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Efficient dynamic hedging for large variable annuity portfolios with multiple underlying assets
- k-means requires exponentially many iterations even in the plane
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Cluster analysis: a modern statistical review
- Convergence analysis of a global optimization algorithm for centroid-based clustering
- Smoothed analysis with adaptive adversaries
- Complexity of local search for Euclidean clustering problems
- Smoothed analysis of online metric problems
- Nonlinear multicriteria clustering based on multiple dissimilarity matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601533)
