图 书 馆
从聚类算法From clustering to algorithms |
|
| 课程网址: | http://videolectures.net/oiml05_zecchina_ca/ |
| 主讲教师: | Riccardo Zecchina |
| 开课单位: | 都灵理工大学 |
| 开课时间: | 2007-02-25 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | In this talk we firstly provide a rigorous probabilistic proof of the clustering phenomenon taking place in the space of solution of random combinatorial problems. Secondly we will discuss a generalization of the survey propagation equations efficiently exploring the clustered geometry. Finally, we discuss the computational consequences of the possibility of finding single clusters by describing a \"physical\" lossy compression scheme. Performance are optimized when the number of well separated clusters is maximal in the underlying physical model. |
| 关 键 词: | 概率证明; 聚类现象; 有损压缩; 单个簇; 底层物理模型 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-06：刘家豪(课程编辑志愿者) |
| 阅读次数: | 78 |