对网络的推断Inference for Networks |
|
课程网址: | http://videolectures.net/mlss09us_bickel_in/ |
主讲教师: | Peter J. Bickel |
开课单位: | 加州大学伯克利分校 |
开课时间: | 2009-07-30 |
课程语种: | 英语 |
中文简介: | 最近已经基于对应于边缘的关系确定子社区,对应于未标记图形中的顶点(Neman,SIAM Review 2003; Airoldi等人JMLR 2008; Leskovec& Kleinberg等人的SIGKDD 2005)用于无限未标记图的概率遍历模型。 我们推动了Newman-Girvon索引的一致性属性,并开发了一个具有更好的一致性属性和更好的模拟数据集性能的索引。 这是与Aiyou Chen的联合工作。 |
课程简介: | A great deal of attention has recently been paid to determining sub-communities on the basis of relations, corresponding to edges, between individuals, corresponding to vertices out of an unlabelled graph (Neman, SIAM Review 2003; Airoldi et al JMLR 2008; Leskovec & Kleinberg et al SIGKDD 2005) for probabilistic ergodic models of infinite unlabelled graphs. We drive consistency properties of the Newman-Girvon index, and develop an index with better consistency properties and better performance on simulated data sets. This is joint work with Aiyou Chen. |
关 键 词: | 子社区; 概率遍历模型; 一致性属性 |
课程来源: | 视频讲座网 |
最后编审: | 2019-07-17:cjy |
阅读次数: | 36 |