arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.11230cs.SIcs.LGstat.ML
收藏

自我中心抽样部分网络上低秩模型的拟合

Fitting Low-rank Models on Egocentrically Sampled Partial Networks

University of Virginia(弗吉尼亚大学)

Angus Chan, Tianxi Li

摘要:

随机网络的统计建模已被广泛用于揭示复杂系统中的相互作用机制,并预测现实世界网络中未观察到的链接。在许多应用中,网络连接是通过以自我为中心的采样来收集的:首先对节点的子集进行采样,然后记录涉及该子集的所有链接;所有其他信息都丢失了。与“随机一致缺失”假设相比,自我中心抽样部分网络需要专门设计的建模策略。目前的统计方法要么在计算上不可行,要么基于直观的设计,没有理论依据。在这里,我们提出了一种方法来适应一般的低秩模型的自我中心采样网络,其中包括几个流行的网络模型。该方法基于图的谱特性,对于大规模网络计算效率高。由于稀疏网络的自我中心采样,它导致丢失的子网络的一致恢复。据我们所知,该方法提供了第一个理论保证自我中心的部分网络估计范围内的低秩模型。我们评估的技术在几个合成和现实世界的网络,并表明它提供了有竞争力的性能在链接预测任务。

英文摘要:

The statistical modeling of random networks has been widely used to uncover interaction mechanisms in complex systems and to predict unobserved links in real-world networks. In many applications, network connections are collected via egocentric sampling: a subset of nodes is sampled first, after which all links involving this subset are recorded; all other information is missing. Compared with the assumption of ``uniformly missing at random", egocentrically sampled partial networks require specially designed modeling strategies. Current statistical methods are either computationally infeasible or based on intuitive designs without theoretical justification. Here, we propose an approach to fit general low-rank models for egocentrically sampled networks, which include several popular network models. This method is based on graph spectral properties and is computationally efficient for large-scale networks. It results in consistent recovery of missing subnetworks due to egocentric sampling for sparse networks. To our knowledge, this method offers the first theoretical guarantee for egocentric partial network estimation in the scope of low-rank models. We evaluate the technique on several synthetic and real-world networks and show that it delivers competitive performance in link prediction tasks.

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

↑