← Search

Rudy Zhou

2 accepted papers

2021

Robust Online Correlation Clustering

NeurIPS 2021poster

In correlation clustering we are given a set of points along with recommendations whether each pair of points should be placed in the same cluster or into separate clusters. The goal cluster the points to minimize disagreements from the recommendations. We study the correlation clustering problem in…

Cited by 21SourcePDFScholar
2020

Fast Noise Removal for k-Means Clustering

AISTATS 2020poster

This paper considers k-means clustering in the presence of noise. It is known that k-means clustering is highly sensitive to noise, and thus noise should be removed to obtain a quality solution. A popular formulation of this problem is called k-means clustering with outliers. The goal of k-means clu…

Cited by 37SourcePDFScholar