arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.00494stat.MLcs.LGstat.ME
收藏

部分观测网络数据的图子估计

Graphon Estimation from Partially Observed Network Data

Indian Statistical Institute(印度统计研究所);Indian Institute of Technology, Kanpur(印度理工学院坎普尔分校)

Soumendu Sundar Mukherjee, Sayak Chakrabarti

摘要:

我们考虑在没有观测到整个网络--只有一些重叠的子图--的情况下,估计由图子模型生成的网络的边概率矩阵。我们将Zhang等人(2017)的邻域平滑(NBS)算法扩展到这种缺失数据设置,并通过实验表明,对于各种各样的图子,扩展的NBS算法实现了比标准图子估计算法(如香草邻域平滑(NBS),通用奇异值阈值(USVT),块模型近似,矩阵完成,我们还表明,扩展的NBS算法是更强大的缺失数据。

英文摘要:

We consider estimating the edge-probability matrix of a network generated from a graphon model when the full network is not observed---only some overlapping subgraphs are. We extend the neighbourhood smoothing (NBS) algorithm of Zhang et al. (2017) to this missing-data set-up and show experimentally that, for a wide range of graphons, the extended NBS algorithm achieves significantly smaller error rates than standard graphon estimation algorithms such as vanilla neighbourhood smoothing (NBS), universal singular value thresholding (USVT), blockmodel approximation, matrix completion, etc. We also show that the extended NBS algorithm is much more robust to missing data.

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

↑