局部相依随机图模型的大规模估计
Large-scale estimation of random graph models with local dependence
摘要:
一类随机图模型被认为是,指数族模型和潜在结构模型的功能相结合,保留他们的优点,同时减少他们每个人的弱点的目标。一个开放的问题是如何从大型网络中估计这样的模型。提出了一种新的大规模估计方法,利用这种模型的局部结构进行局部计算。其主要思想是,具有局部依赖的随机图可以分解成子图,这使得并行计算的子图,并提出了一个两步估计方法。第一步估计随机图的局部结构。第二步估计参数给定随机图的估计的局部结构。这两个步骤可以并行实施,这使得大规模的估计成为可能。两步估计方法的优点通过多达10,000个节点的模拟研究和具有10,000多个产品的大型亚马逊产品推荐网络的应用程序来证明。
英文摘要:
A class of random graph models is considered, combining features of exponential-family models and latent structure models, with the goal of retaining the strengths of both of them while reducing the weaknesses of each of them. An open problem is how to estimate such models from large networks. A novel approach to large-scale estimation is proposed, taking advantage of the local structure of such models for the purpose of local computing. The main idea is that random graphs with local dependence can be decomposed into subgraphs, which enables parallel computing on subgraphs and suggests a two-step estimation approach. The first step estimates the local structure underlying random graphs. The second step estimates parameters given the estimated local structure of random graphs. Both steps can be implemented in parallel, which enables large-scale estimation. The advantages of the two-step estimation approach are demonstrated by simulation studies with up to 10,000 nodes and an application to a large Amazon product recommendation network with more than 10,000 products.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。