Thursday, December 5 2019

1:00pm - 1:30pm

1:00pm - 1:30pm

Operations Research Seminar

An Implementation of Separation-Preserving Clustering Transformations

Separable clusterings of a data set can be represented as the vertices of the so-called partition polytopes. In many applications, a transition between two given clusterings is required. Each step of this transition is supposed to keep separation of the current clusters.

Such a transition can be modeled as an edge walk in the partition polytopes. An implementation of such a scheme is a significant challenge, in particular due to the lack of an explicit representation of these polytopes. We discuss the basics of the underlying mathematics and then turn to details of a successful implementation.

Such a transition can be modeled as an edge walk in the partition polytopes. An implementation of such a scheme is a significant challenge, in particular due to the lack of an explicit representation of these polytopes. We discuss the basics of the underlying mathematics and then turn to details of a successful implementation.

Speaker: | Stetson Zirkelbach |

Affiliation: | University of Colorado Denver |

Location: | SCB 4119 |

Done