Speeding Up Constrained k-Means Through 2-Means

08/13/2018
by   Qilong Feng, et al.
0

For the constrained 2-means problem, we present a O(dn+d(1ϵ)^O(1ϵ) n) time algorithm. It generates a collection U of approximate center pairs (c_1, c_2) such that one of pairs in U can induce a (1+ϵ)-approximation for the problem. The existing approximation scheme for the constrained 2-means problem takes O((1ϵ)^O(1ϵ)dn) time, and the existing approximation scheme for the constrained k-means problem takes O((kϵ)^O(kϵ)dn) time. Using the method developed in this paper, we point out that every existing approximating scheme for the constrained k-means so far with time C(k, n, d, ϵ) can be transformed to a new approximation scheme with time complexity C(k, n, d, ϵ)/ k^Ω(1ϵ).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2020

FPT Approximation for Constrained Metric k-Median/Means

The Metric k-median problem over a metric space (𝒳, d) is defined as fol...
research
10/27/2020

Improved Guarantees for k-means++ and k-means++ Parallel

In this paper, we study k-means++ and k-means++ parallel, the two most p...
research
10/27/2021

Tight FPT Approximation for Constrained k-Center and k-Supplier

In this work, we study a range of constrained versions of the k-supplier...
research
09/16/2019

Streaming PTAS for Constrained k-Means

We generalise the results of Bhattacharya et al. (Journal of Computing S...
research
03/04/2021

A Simple Algorithm for the Constrained Sequence Problems

In this paper we address the constrained longest common subsequence prob...
research
12/17/2018

A stochastic approximation method for chance-constrained nonlinear programs

We propose a stochastic approximation method for approximating the effic...
research
03/09/2017

A log-linear time algorithm for constrained changepoint detection

Changepoint detection is a central problem in time series and genomic da...

Please sign up or login with your details

Forgot password? Click here to reset