Nathaniel Dean 

(Computational & Applied Mathematics, Rice University) 

Algorithms for Data Clustering and Graph Drawing

 

Abstract

Clustering is often used to classify complex systems of objects according to perceived similarities. It helps us organize and interpret observations. When the objects are modeled as vertices in a graph clustering seems almost identical to graph drawing. This talk explores certain well-known clustering methods used for data analysis and discusses how some of them are being used to attack open problems in graph theory. A short video will be shown to illustrate some of these ideas. 
 
Last updated by  am@charlie.iit.edu  on 01/27/01