网络时钟:检测信息扩散的时间尺度
Network Clocks: Detecting the Temporal Scale of Information Diffusion
摘要:
信息扩散模型通常假设信息令牌在网络中传播的离散时间轴。由于在现实世界的网络中的用户显着不同的强度和活动周期,我们在这项工作中的目标是回答:如何确定一个时间尺度,最好的同意与观察到的信息传播网络内?现有方法的一个关键限制是它们将时间轴聚合成固定大小的窗口,这可能不适合所有网络节点的活动周期。我们提出了一个异构网络时钟的概念:事件的离散时间戳,最好地解释他们的发生根据一个给定的级联传播模型的映射。我们专注于广泛采用的独立级联(IC)模型和形式化的最佳时钟,最大限度地提高所有观察到的级联的可能性。单最优时钟问题可以在多项式时间内精确求解。然而,我们证明了学习多个最优时钟(KOC),对应于网络节点组的时间模式,是NP-难的。我们提出了可扩展的解决方案,运行在几乎线性的时间在级联激活的总数,并讨论每个变量的近似保证。我们的算法及其检测到的时钟可以改进级联大小分类(高达8%的F1提升)和改进缺失级联数据推断(召回率提高0.15)。我们还表明,网络时钟表现出一致性的内容扩散在网络中的类型,并相对于IC模型的传播概率参数是强大的。
英文摘要:
Information diffusion models typically assume a discrete timeline in which an information token spreads in the network. Since users in real-world networks vary significantly in their intensity and periods of activity, our objective in this work is to answer: How to determine a temporal scale that best agrees with the observed information propagation within a network? A key limitation of existing approaches is that they aggregate the timeline into fixed-size windows, which may not fit all network nodes' activity periods. We propose the notion of a heterogeneous network clock: a mapping of events to discrete timestamps that best explains their occurrence according to a given cascade propagation model. We focus on the widely-adopted independent cascade (IC) model and formalize the optimal clock as the one that maximizes the likelihood of all observed cascades. The single optimal clock (OC) problem can be solved exactly in polynomial time. However, we prove that learning multiple optimal clocks(kOC), corresponding to temporal patterns of groups of network nodes, is NP-hard. We propose scalable solutions that run in almost linear time in the total number of cascade activations and discuss approximation guarantees for each variant. Our algorithms and their detected clocks enable improved cascade size classification (up to 8 percent F1 lift) and improved missing cascade data inference (0.15 better recall). We also demonstrate that the network clocks exhibit consistency within the type of content diffusing in the network and are robust with respect to the propagation probability parameters of the IC model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。