Friday, April 10 2020
12:00pm - 1:00pm
Masters Presentation
An LP-based Implementation of the Transformation of Separable Clusterings

We study applications in which a transition between two given separable clusterings is required. This transition should be a sequence of clusterings, each of them retaining separability, gradually transforming the first clustering into the second one.

Separable clusterings of a data set are found as the vertices of the so-called partition polytopes. A corresponding transition can be modeled as an edge walk in such a polytope, with each step computed by parametric analysis of the change between two known clusterings. In this project, we implement and visualize an algorithm to this end. We will discuss the basics of the underlying math and the significant challenges of the implementation.

Committee Chair - Advisor - Steffen Borgwardt
Committee Steve Billups, Emily Speakman
Speaker:Stetson Zirkelbach
Location:See Zoom link from email

Download as iCalendar