顶点提名:典型抽样和扩展谱提名方案
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
摘要:
假设随机块模型中的一个特定块是感兴趣的,但块标签仅在网络中的少数顶点上观察到。利用从模型和观察到的块标签实现的图,顶点提名任务是将具有未观察到的块标签的顶点排序到排名提名列表中,目标是在列表的顶部附近具有丰富的感兴趣的顶点。文献中已有顶点指定方案,包括最优精确规范指定方案~ $\mathcal{L}^C$和一致谱划分指定方案~ $\mathcal{L}^P$。虽然规范的提名计划$\mathcal{L}^C$是可证明的最佳精确的,它是计算上棘手的,是不切实际的,即使在适度大小的图上实现。考虑到这一点,引入了一种近似的规范方案-表示为{ \it规范采样提名方案} $\mathcal{L}^{CS}$ --; $\mathcal{L}^{CS}$依赖于一种可扩展的、基于马尔可夫链蒙特卡罗的近似$\mathcal{L}^{C}$,并随着采样量趋于无穷大而收敛到$\mathcal{L}^{C}$。谱划分提名方案也扩展到{ \it扩展谱划分提名方案},$\mathcal{L}^{EP}$,它引入了一种新的半监督聚类框架,以提高$\mathcal{L}^P$的精度。真实数据和模拟实验来说明这些顶点提名方案的精度,以及它们的经验计算复杂度。关键词:顶点提名,马尔可夫链蒙特卡罗,谱划分,MECHANISM MSC[2010]:60 J22,65 C40,62 H30,62 H25
英文摘要:
Suppose that one particular block in a stochastic block model is of interest, but block labels are only observed for a few of the vertices in the network. Utilizing a graph realized from the model and the observed block labels, the vertex nomination task is to order the vertices with unobserved block labels into a ranked nomination list with the goal of having an abundance of interesting vertices near the top of the list. There are vertex nomination schemes in the literature, including the optimally precise canonical nomination scheme~$\mathcal{L}^C$ and the consistent spectral partitioning nomination scheme~$\mathcal{L}^P$. While the canonical nomination scheme $\mathcal{L}^C$ is provably optimally precise, it is computationally intractable, being impractical to implement even on modestly sized graphs. With this in mind, an approximation of the canonical scheme---denoted the {\it canonical sampling nomination scheme} $\mathcal{L}^{CS}$---is introduced; $\mathcal{L}^{CS}$ relies on a scalable, Markov chain Monte Carlo-based approximation of $\mathcal{L}^{C}$, and converges to $\mathcal{L}^{C}$ as the amount of sampling goes to infinity. The spectral partitioning nomination scheme is also extended to the {\it extended spectral partitioning nomination scheme}, $\mathcal{L}^{EP}$, which introduces a novel semisupervised clustering framework to improve upon the precision of $\mathcal{L}^P$. Real-data and simulation experiments are employed to illustrate the precision of these vertex nomination schemes, as well as their empirical computational complexity. Keywords: vertex nomination, Markov chain Monte Carlo, spectral partitioning, Mclust MSC[2010]: 60J22, 65C40, 62H30, 62H25
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。