tutorial_on_spectral_clustering
所属分类:数学计算
开发工具:PDF
文件大小:345KB
下载次数:20
上传日期:2010-04-04 16:33:46
上 传 者:
cckk_1112
说明: In recent years, spectral clustering has become one of the most popular modern clustering algorithms.
It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms
traditional clustering algorithms such as the k-means algorithm. Nevertheless, on the first glance spectral clustering
looks a bit mysterious, and it is not obvious to see why it works at all and what it really does. This article is a
tutorial introduction to spectral clustering. We describe different graph Laplacians and their basic properties,
present the most common spectral clustering algorithms, and derive those algorithms from scratch by several
different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.
文件列表:
tutorial_on_spectral_clustering.pdf (406627, 2010-04-01)
近期下载者:
相关文件:
收藏者: