图 书 馆
在大型网络中从拓扑中推断顶点属性Inferring vertex properties from topology in large networks |
|
| 课程网址: | http://videolectures.net/mlg07_aukia_ivp/ |
| 主讲教师: | Janne Aukia |
| 开课单位: | 创汇公司 |
| 开课时间: | 2007-09-05 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic latent-variable model which finds either latent blocks or more graded structures, depending on hyperparameters. With collapsed Gibbs sampling it can be estimated for networks of 106 vertices or more, and the number of latent components adapts to data through a Dirichlet process prior. Applied to the social network of a music recommendation site (Last.fm), reasonable combinations of musical genres appear from the network topology, as revealed by subsequent matching of the latent structure with listening habits of the participants. The advantages of the generative nature of the model are explicit handling of uncertainty in the sparse data, and easy interpretability, extensibility, and adaptation to applications with incomplete data. |
| 关 键 词: | 网络拓扑; 顶点属性; 概率潜变量模型 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2021-01-25：chenxin |
| 阅读次数: | 68 |