图 书 馆
基于图p-Laplacian的谱聚类Spectral Clustering Based on the Graph p-Laplacian |
|
| 课程网址: | https://videolectures.net/videos/icml09_buhler_scb |
| 主讲教师: | Thomas Bühler |
| 开课单位: | 会议 |
| 开课时间: | 2009-08-26 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvector of the graph p-Laplacian interpolates between a relaxation of the normalized and the Cheeger cut. Moreover, we prove that in the limit as p ! 1 the cut found by thresholding the second eigenvector of the graph p-Laplacian converges to the optimal Cheeger cut. Furthermore, we provide an efficient numerical scheme to compute the second eigenvector of the graph p- Laplacian. The experiments show that the clustering found by p-spectral clustering is at least as good as normal spectral clustering, but often leads to signifi cantly better results. |
| 关 键 词: | 拉普拉斯; 非线性推广; 归一化松弛 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2025-04-25：liyq |
| 最后编审: | 2025-04-25：liyq |
| 阅读次数: | 7 |