图 书 馆
图表上的半定列排名Semidefinite ranking on graphs |
|
| 课程网址: | http://videolectures.net/sicgt07_vembu_srog/ |
| 主讲教师: | Shankar Vembu |
| 开课单位: | 伊利诺伊大学 |
| 开课时间: | 2007-09-07 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | We consider the problem of ranking the vertices of an undirected graph given some preference relation. This ranking on graphs problem has been tackled before using spectral relaxations in [1]. Their approach is strongly related to the spectral relaxation made in spectral clustering algorithms. One problem with spectral relaxations that has been found in clustering is that even on simple toy graphs the spectral solution can be arbitrarily far from the optimal one [2]. It has recently been shown that semidefinite relaxations offer in many cases better solutions than spectral ones for clustering [3] and transductive classification [4]. We therefore investigate semidefinite relaxations of ranking on graphs. |
| 关 键 词: | 谱聚类算法; 谱松弛; 半定区弛豫 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-11：chenxin |
| 阅读次数: | 33 |