arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.10003cs.SI
收藏

关系型社会数据的尺度选择模型

Scaling Choice Models of Relational Social Data

Jan Overgoor, George Pakapol Supaniratisai, Johan Ugander

摘要:

社交网络上的许多预测问题,从推荐到异常检测,都可以通过将网络数据建模为一系列关系事件,然后利用生成的模型进行预测来解决。离散选择的条件logit模型是将关系事件建模为“选择”的一种自然方法,该框架扩展并扩展了许多长期研究的网络形成模型。条件logit模型是简单的,但它特别有吸引力,因为它允许通过负采样实现有效的一致似然最大化,这对于混合logit和许多其他更丰富的模型来说是不正确的。负抽样的价值尤其显著,因为关系数据中的选择集通常是巨大的。鉴于负采样的重要性,在这项工作中,我们引入了一个模型简化技术的混合logit模型,我们称之为“去混合”,从而标准的混合模型的网络形成-特别是模型,混合本地和全球的链接形成-重新制定操作模式不相交的选择集。这种重新表述将混合logit模型简化为条件logit模型,为负采样打开了大门,同时还通过最大化混合模型可能性来规避其他标准挑战。为了进一步提高可扩展性,我们还研究了重要性采样,以更有效地选择负样本,发现它可以大大加快标准和去混合模型的推理。总之,这些步骤使得在非常大的图中更真实地建模网络形成成为可能。我们说明了我们对已知地面真实的合成数据集以及Venmo平台上的大规模公共交易数据集的改进的相对收益。

英文摘要:

Many prediction problems on social networks, from recommendations to anomaly detection, can be approached by modeling network data as a sequence of relational events and then leveraging the resulting model for prediction. Conditional logit models of discrete choice are a natural approach to modeling relational events as "choices" in a framework that envelops and extends many long-studied models of network formation. The conditional logit model is simplistic, but it is particularly attractive because it allows for efficient consistent likelihood maximization via negative sampling, something that isn't true for mixed logit and many other richer models. The value of negative sampling is particularly pronounced because choice sets in relational data are often enormous. Given the importance of negative sampling, in this work we introduce a model simplification technique for mixed logit models that we call "de-mixing", whereby standard mixture models of network formation---particularly models that mix local and global link formation---are reformulated to operate their modes over disjoint choice sets. This reformulation reduces mixed logit models to conditional logit models, opening the door to negative sampling while also circumventing other standard challenges with maximizing mixture model likelihoods. To further improve scalability, we also study importance sampling for more efficiently selecting negative samples, finding that it can greatly speed up inference in both standard and de-mixed models. Together, these steps make it possible to much more realistically model network formation in very large graphs. We illustrate the relative gains of our improvements on synthetic datasets with known ground truth as well as a large-scale dataset of public transactions on the Venmo platform.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑