0


从不完全观测获得信息扩散的重构模式

Reconstructing Patterns of Information Diffusion from Incomplete Observations
课程网址: http://videolectures.net/nips2011_chierichetti_observations/  
主讲教师: Flavio Chierichetti
开课单位: 罗马大学
开课时间: 2012-01-25
课程语种: 英语
中文简介:
由于网上信息的普遍传播,特别是网上请愿,近年来的研究提出了以下组合估计问题。有一个树t我们不能直接观察(代表信息传播的结构),某些节点随机决定公开其信息副本。在请愿书的情况下,请愿书的每一份公开副本上的名字列表也揭示了一条通向树根的路径。从这些揭示的路径中我们可以得出关于树的性质的什么结论,并且我们可以使用观察到的树的结构来估计完全未观察到的树t的大小吗?在这里,我们为这个大小估计任务提供了第一个算法,以及对其性能的可证明的保证。我们还建立了观察到的树的结构属性,为在互联网上传播真正的连锁信请愿中出现的一些不寻常的结构现象提供了第一个严格的解释。
课程简介: Motivated by the spread of on-line information in general and on-line petitions in particular, recent research has raised the following combinatorial estimation problem. There is a tree T that we cannot observe directly (representing the structure along which the information has spread), and certain nodes randomly decide to make their copy of the information public. In the case of a petition, the list of names on each public copy of the petition also reveals a path leading back to the root of the tree. What can we conclude about the properties of the tree we observe from these revealed paths, and can we use the structure of the observed tree to estimate the size of the full unobserved tree T? Here we provide the first algorithm for this size estimation task, together with provable guarantees on its performance. We also establish structural properties of the observed tree, providing the first rigorous explanation for some of the unusual structural phenomena present in the spread of real chain-letter petitions on the Internet.
关 键 词: 组合估计问题; 在线信息传播; 规模估计
课程来源: 视频讲座网
最后编审: 2020-06-01:wuyq
阅读次数: 39