图 书 馆
直推式Rademacher复杂性学习图Transductive Rademacher complexities for learning over a graph |
|
| 课程网址: | http://videolectures.net/sicgt07_pelckmans_trc/ |
| 主讲教师: | Kristiaan Pelckmans |
| 开课单位: | 乌普萨拉大学 |
| 开课时间: | 2007-09-07 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Recent investigations indicate the use of a probabilistic ”learning” perspective of tasks defined on a single graph, as opposed to the traditional algorithmical ”computational” point of view. This note discusses the use of Rademacher complexities in this setting, and illustrates the use of Kruskal’s algorithm for transductive inference based on a nearest neighbor rule. |
| 关 键 词: | 计算机科学; 机器学习; 图形模型 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-02：张荧(课程编辑志愿者) |
| 阅读次数: | 45 |