Related references
Note: Only part of the references are listed.The seeding algorithm for k-means problem with penalties
Min Li et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2020)
The Parallel Seeding Algorithm for k-Means Problem with Penalties
Min Li et al.
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH (2020)
An output-oriented classification of multiple attribute decision-making techniques based on fuzzy c-means clustering method
Ezzatollah Asgharizadeh et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2019)
Local search approximation algorithms for the k-means problem with penalties
Dongmei Zhang et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2019)
Good Clusterings Have Large Volume
Steffen Borgwardt et al.
OPERATIONS RESEARCH (2019)
Improved and simplified inapproximability for k-means
Euiwoong Lee et al.
INFORMATION PROCESSING LETTERS (2017)
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
Sara Ahmadian et al.
2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2017)
Scalable K-Means++
Bahman Bahmani et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2012)
NP-hardness of Euclidean sum-of-squares clustering
Daniel Aloise et al.
MACHINE LEARNING (2009)
Penalized and weighted K-means for clustering with scattered objects and prior information in high-throughput biological data
George C. Tseng
BIOINFORMATICS (2007)
Clustering large graphs via the Singular Value Decomposition
P Drineas et al.
MACHINE LEARNING (2004)
A local search approximation algorithm for k-means clustering
T Kanungo et al.
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS (2004)
Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
K Jain et al.
JOURNAL OF THE ACM (2001)
Share Paper
