0


重叠社区的可扩展推理

Scalable Inference of Overlapping Communities
课程网址: http://videolectures.net/machine_gopalan_overlapping/  
主讲教师: Prem Gopalan
开课单位: 普林斯顿大学
开课时间: 2013-06-11
课程语种: 英语
中文简介:
我们开发了一种可扩展的算法,用于大型网络中重叠社区的后向推理。我们的算法基于混合隶属度随机块模型中的随机变分推理。它自然地对网络进行二次采样,并估计其社区结构。我们将算法应用于具有多达60,000个节点的十个大型真实世界网络。它比MMSB的现有算法快几十个数量级,在大型现实世界网络中发现了数百个社区,并且与其他可扩展算法相比,在280个基准网络中检测到真正的社区,具有相同或更高的准确性。
课程简介: We develop a scalable algorithm for posterior inference of overlapping communities in large networks. Our algorithm is based on stochastic variational inference in the mixed-membership stochastic blockmodel. It naturally interleaves subsampling the network with estimating its community structure. We apply our algorithm on ten large, real-world networks with up to 60,000 nodes. It converges several orders of magnitude faster than the state-of-the-art algorithm for MMSB, finds hundreds of communities in large real-world networks, and detects the true communities in 280 benchmark networks with equal or better accuracy compared to other scalable algorithms.
关 键 词: 可扩展; 算法; 重叠社区
课程来源: 视频讲座网
最后编审: 2019-05-15:cwx
阅读次数: 59