Clustering - An overview
author:
Marina Meila,
Department of Statistics, University of Washington
Description
Clustering, or finding groups in data, is as old as machine learning itself, if not older. However, as more people use clustering in a variety of settings, the last few years we have brought unprecedented developments in this field. This tutorial will survey the most important clustering methods in use today from a unifying perspective. I will then present some of the current paradigms shifts in data clustering.
You might be experiencing some problems with Your Video player.
| Slides | |
| 0:00 | Clustering - A tutorial overview |
| 0:06 | Clustering - A tutorial overview |
| 0:33 | Outline |
| 2:39 | Selecting K |
| 13:47 | The gap statistic |
| 17:29 | Practicalities |
| 20:30 | The KL statistic |
| 25:44 | Stability methods for choosing K |
| 34:11 | Clustering with outliers |
| 45:24 | To come next |
| 45:42 | Algorithms based on |
| 50:59 | Kernel density estimation |
| 54:54 | The Nugent-Stuetzle algorithm |
| 65:11 | Mean shift algorithms |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
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.
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !






