An improved probability-one homotopy map for tracking constrained clustering solutions
This paper proposes a new homotopy map for use with constrained clustering problems, improving over previously introduced maps through the introduction of a K-Means approximation and the use of the Kreisselmeier-Steinhauser function to provide more efficient computation, as well as demonstrating through experimentation the power of this new map.
No items found<!- View not found ->
- Date of publication:
- April 12, 2015
- Spring Simulation Multiconference