0


谱聚类

Spectral Clustering
课程网址: http://videolectures.net/mlcued08_azran_mcl/  
主讲教师: Arik Azran
开课单位: 视频讲座网
开课时间: 2008-03-03
课程语种: 英语
中文简介:
谱聚类是一种在数据中寻找群体结构的技术。它的基础是将数据点视为一个连通图的节点,通过将这个图根据其谱分解划分为具有一些理想属性的子图来发现集群。我这次演讲的计划是对主要的谱聚类算法进行回顾,展示它们的能力和局限性,并就该方法何时能够成功提供一些见解。本文没有假设之前的知识,任何对聚类(或线性代数的有趣应用)感兴趣的人都可能会觉得这个演讲很有趣
课程简介: Machine Learning Tutorial Lecture Spectral clustering is a technique for finding group structure in data. It is based on viewing the data points as nodes of a connected graph and clusters are found by partitioning this graph, based on its spectral decomposition, into subgraphs that posses some desirable properties. My plan for this talk is to give a review of the main spectral clustering algorithms, demonstrate their abilities and limitations and offer some insight into when the method can be expected to be successful. No previous knowledge is assumed, and anyone who is interested in clustering (or fun applications of linear algebra) might find this talk interesting.
关 键 词: 群体结构; 理想属性; 聚类算法
课程来源: 视频讲座网
数据采集: 2022-11-24:chenxin01
最后编审: 2022-11-24:chenxin01
阅读次数: 26