图 书 馆
使集中（图形）计算更快、更分散并且（有时）更好Making centralized (graph) computation faster, distributed and (at times) better |
|
| 课程网址: | http://videolectures.net/cyberstat2012_shah_centralized_computati... |
| 主讲教师: | Devavrat Shah |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2012-10-16 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | I will introduce a generic method for approximate inference in graphical models using graph partitioning. The resulting algorithm is linear time and provides an excellent approximation for the maximum a posteriori assignment (MAP) in a larger class of graphical model including any graph with "polynomial growth" and graph that exclude fixed minors (e.g. planar graphs). In general, the algorithm can be thought of as a "meta" algorithm that can be used to speed up any existing inference algorithm without losing performance. The goal of the talk is to primarily introduce the algorithm and provide insights into why such a simplistic algorithm works. Time permitting, I will also discuss its implication for "modularity clustering" that has been popularly utilized in processing networked data. |
| 关 键 词: | 图分区; 线性时间; 网络数据 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-03-13：lxf |
| 阅读次数: | 86 |