Constrained clustering via concavity cuts

Yu Xia
(2007) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference, CPAIOR 2007 — Location: Brussels, Belgium (23.May.2007)

Files

No attached file found for this publication.

Details

Authors
  • Yu Xia
    Author
Abstract
In this paper, we adapt Tuy's concave cutting plane method to the problem of finding an optimal grouping of semi-supervised clustering. We also give properties of local optimal solutions to the semi-supervised clustering. On test data sets with up to 1500 points, our algorithm typically find a solution with objective value around 2% smaller of the initial function value than that obtained by k-means algorithm within 4 seconds, although the run time is hundred times of that of the k-means algorithm.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Yu Xia. (2007). Constrained clustering via concavity cuts. In Van Hentenryck, P.; Wolsey, L.; (ed.), Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007 (p. p. 318-331). Springer-verlag. https://hdl.handle.net/2078.5/228753