# Max-margin clustering with size constraint

Given a dataset $D$ and a distance measure, I want to split the dataset into two disjoint subsets $X, Y$ of a specified size (say 80% and 20% of the original size), so that the minimum distance of all pairs $(x, y)$ with $x \in X$ and $y \in Y$ is maximized. I found references to max-margin clustering without the size constraint, however my feeling is that the constraint should make the problem easier - does it? Is there some straightforward way to solve this problem?

-
 can you please cite these references? – mpiktas Mar 7 '11 at 8:07 @mpiktas - well, it was just the result of a google search on max-margin clustering, the "original" paper on it seems to be webdocs.cs.ualberta.ca/~dale/papers/nips04.ps.gz (Xu et al, NIPS 2004) – etarion Mar 7 '11 at 9:33