图 书 馆
大直径图形的在线预测Online Prediction on Large Diameter Graphs |
|
| 课程网址: | http://videolectures.net/wehys08_lever_opldg/ |
| 主讲教师: | Guy Lever |
| 开课单位: | 伦敦大学学院 |
| 开课时间: | 2008-12-20 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the number of mistakes made by such algorithms may be proportional to the square root of the number of vertices, even when tackling simple problems. We overcome this drawback by means of an efficient algorithm which achieves a logarithmic mistake bound. It is based on the notion of a spine, a path graph which provides a linear embedding of the original graph. In practice, graphs may exhibit cluster structure; thus in the last part, we present a modified algorithm which achieves the “best of both worlds”: it performs well locally in the presence of cluster structure, and globally on large diameter graphs. |
| 关 键 词: | 集群结构; 图; 拉普拉斯算法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2021-02-04：nkq |
| 阅读次数: | 49 |