Computer Science Masters Thesis Presentation

Friday, October 30, 2015 - 1:30pm

Location:

8102 Gates & Hillman Centers

Speaker:

PRASHANT SRIDHAR, 5th Year Masters Student /PRASHANT%20SRIDHAR

For More Information, Contact:

tracyf @ cs.cmu.edu

Common clustering techniques involve assumptions on the distribution that the data is drawn from, with linearity often being a standard assumption. These techniques work pooly on irregular data sets or on rare clusters. Non-parametric solutions are often inefficient to use in practice and still fail to find rare clusters. This thesis explores geometric approaches to non-parametric clustering that should be much better at identifying these rare clusters.
The first approah explores how the Gabriel graph can be used to compute density based distance metrics and how the Grabriel graph itself might be used to cluster data. The second approach views the probability density function as a heat distribution over a metal plate. Traditionally, finite element or control volume methods construct graphs over meshes on the metal plate. This approach explores how these meshes could be used to partition space.  Finally, we present the results of running these clustering algorithms on flow cytometry data and compare these to present state of the art non-parametric methods on the field.
Thesis Committee:Gary Miller (Chair)Alexander Smola
Copy of Draft Proposal Document

Keywords:

Masters Thesis Presentation