| || |
Submitted by pscully on Mon, 04/20/2009 - 10:38.
04/23/2009 - 16:10
04/23/2009 - 17:30
STA/BST 290: Bruno Pelletier
Clustering with level sets
THURSDAY, April 23rd, 2009 at 4.10pm, MSB 1147 (Colloquium Room)
Speaker: Bruno Pelletier (Univ. Montpellier II, France, visiting UC San Diego)
Title: Clustering with level sets
Abstract: The objective of clustering, or unsupervised classification, is to partition a set of observations into different groups, or clusters, based on their similarities. Following Hartigan, a cluster is defined as a connected component of an upper level set of the underlying density. In this talk, we introduce a spectral clustering algorithm on estimated level sets, and we establish its strong consistency. We also discuss the estimation of the number of connected components of density level sets.