Improved MapReduce and Streaming Algorithms for k-Center Clustering (with Outliers)

02/26/2018
by   Matteo Ceccarello, et al.
0

We present efficient MapReduce and Streaming algorithms for the k-center problem with and without outliers. Our algorithms exhibit an approximation factor which is arbitrarily close to the best possible, given enough resources.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2018

Small Space Stream Summary for Matroid Center

In the matroid center problem, which generalizes the k-center problem, w...
research
02/21/2019

Continuous Outlier Mining of Streaming Data in Flink

In this work, we focus on distance-based outliers in a metric space, whe...
research
02/24/2023

k-Center Clustering with Outliers in the MPC and Streaming Model

Given a point set P ⊆ X of size n in a metric space (X,dist) of doubling...
research
02/20/2023

Fair k-Center: a Coreset Approach in Low Dimensions

Center-based clustering techniques are fundamental in some areas of mach...
research
01/07/2022

k-Center Clustering with Outliers in Sliding Windows

Metric k-center clustering is a fundamental unsupervised learning primit...
research
02/23/2021

Robust k-Center with Two Types of Radii

In the non-uniform k-center problem, the objective is to cover points in...
research
02/18/2020

How to Solve Fair k-Center in Massive Data Models

Fueled by massive data, important decision making is being automated wit...

Please sign up or login with your details

Forgot password? Click here to reset