New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Algorithm fails without conflict constraint #9

Closed

neozhangthe1 opened this issue Feb 9, 2018 · 1 comment

neozhangthe1 commented Feb 9, 2018

consider the following case

if we want to cluster x1, x2, x3 into two clusters
with cannot links (x1, x3) and (x2, x3)

we first assign x1 to cluster1, and x2 to cluster2
the algorithm fails because there is no cluster for x3 to be assigned

Owner

Behrouz-Babaki commented Feb 11, 2018 •

edited

@neozhangthe1 COP-Kmeans is a greedy algorithm and can not anticipate (or backtrack from) such mistakes.

(I have developed another algorithm that recovers from such cases. I will make the implementation publicly available once the paper is published.)

Behrouz-Babaki closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment