Adaptive Density Level Set Clustering

author: Ingo Steinwart, Los Alamos National Laboratory
published: Aug. 2, 2011,   recorded: July 2011,   views: 3012


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Clusters are often de fined to be the connected components of a density level set. Unfortunately, this defi nition depends on a level that needs to be user specifi ed by some means. In this paper we present a simple algorithm that is able to asymptotically determine the optimal level, that is, the level at which there is the first split in the cluster tree of the data generating distribution. We further show that this algorithm asymptotically recovers the corresponding connected components. Unlike previous work, our analysis does not require strong assumptions on the density such as continuity or even smoothness.

See Also:

Download slides icon Download slides: colt2011_steinwart_level_01.pdf (1.0┬áMB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: