Efficient Maximum Margin Clustering via Cutting Plane Algorithm

@inproceedings{Zhao2008EfficientMM,
  title={Efficient Maximum Margin Clustering via Cutting Plane Algorithm},
  author={Bin Zhao and Fei Wang and Changshui Zhang},
  booktitle={SDM},
  year={2008}
}
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the maximum margin hyperplane which separates the data from different classes. Traditionally, MMC is formulated as a non-convex integer programming problem and is thus difficult to solve. Several methods have been proposed in the literature to solve the MMC problem based on either semidefinite programming or alternative… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 133 citations. REVIEW CITATIONS

7 Figures & Tables

Topics

Statistics

0204020082009201020112012201320142015201620172018
Citations per Year

134 Citations

Semantic Scholar estimates that this publication has 134 citations based on the available data.

See our FAQ for additional information.