Some remarks on an efficient algorithm to find a centroid in a k-dimensional real space (original) (raw)
Related papers
Approximation algorithms for the k-center problem: an experimental evaluation
The centroid of points with approximate weights
Lecture Notes in Computer Science, 1995
Centroid estimation in discrete high-dimensional spaces with applications in biology
Proceedings of the National Academy of Sciences, 2008
Optimising sum-of-squares measures for clustering multisets defined over a metric space
Discrete Applied Mathematics, 2013
An analysis between exact and approximate algorithms for the k-center problem in graphs
International Journal of Electrical and Computer Engineering (IJECE), 2022
On Approximability of Clustering Problems Without Candidate Centers
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
Optimizing K-Means by Fixing Initial Cluster Centers
International Journal of Current Engineering and Technology, 2011
Linear-time approximation schemes for clustering problems in any dimensions
Journal of The ACM, 2010
On Euclidean k-Means Clustering with α-Center Proximity
2019
Asymmetric k -center is log * n -hard to approximate
Journal of the ACM, 2005
Optimization strategies for rapid centroid estimation
An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem
INFORMS Journal on Computing, 2009
Approximability Results for the p-Center Problem Algorithm Design and Analysis
Dynamic algorithms for k-center on graphs
arXiv (Cornell University), 2023
On Euclidean k-Means Clustering with alpha-Center Proximity
2019
Parameterized Approximation Algorithms for K-center Clustering and Variants
Proceedings of the AAAI Conference on Artificial Intelligence
Linear time algorithms for clustering problems in any dimensions
2005
Examining Heuristics for the K-Centers Problem
K. Senthilkumar, Arka Mukherjee
International Journal of Engineering & Technology, 2018
Bi-criteria Linear-time Approximations for Generalized k-Mean/Median/Center
New Method for Finding Initial Cluster Centroids in K-means Algorithm
International Journal of Computer Applications, 2013
Heuristic and Exact Methods for the Discrete (r |p)Centroid Problem
2010
ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS
International Journal of Computational Geometry & Applications, 2010
Approximate Shortest Distance Computing Using k-Medoids Clustering
Annals of Data Science, 2017
Optimal properties of centroid-based classifiers for very high-dimensional data
Annals of Statistics, 2010
Measurement, 2013
Initialization of Optimized K-Means Centroids Using Divide-And-Conquer Method
2016
A Fast Approximated k-Median Algorithm
2000
K-spectral centroid: extension and optimizations
2018
Clustering for Metric and Nonmetric Distance Measures
2010
VNS-Based Algorithms for the Centroid-Based Clustering Problem
Facta Universitatis, 2019
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
Cornell University - arXiv, 2022
A Survey on Exact and Approximation Algorithms for Clustering