Free access
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

EPTAS for k-means Clustering of Affine Subspaces


We consider a generalization of the fundamental k-means clustering for data with incomplete or corrupted entries. When data objects are represented by points in ℝd, a data point is said to be incomplete when some of its entries are missing or unspecified. An incomplete data point with at most Δ unspecified entries corresponds to an axis-parallel affine subspace of dimension at most Δ, called a Δ-point. Thus we seek a partition of n input Δ-points into k clusters minimizing the k-means objective. For Δ = 0, when all coordinates of each point are specified, this is the usual k-means clustering. We give an algorithm that finds an (1 + )-approximate solution in time f(k, ∊, Δ) · n2 · d for some function f of k, ∊, and Δ only.

Formats available

You can view the full content in the following formats:

Information & Authors


Published In

cover image Proceedings
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
Pages: 2649 - 2659
Editor: Dániel Marx, CISPA Helmholtz Center for Information Security, Germany
ISBN (Online): 978-1-61197-646-5


Published online: 7 January 2021




A full version of this paper is available at

Metrics & Citations



If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options


View PDF

Get Access







Copy the content Link

Share with email

Email a colleague

Share on social media

On May 28, 2024, our site will enter Read Only mode for a limited time in order to complete a platform upgrade. As a result, the following functions will be temporarily unavailable: registering new user accounts, any updates to existing user accounts, access token activations, and shopping cart transactions. Contact [email protected] with any questions.