arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.01369stat.ML
收藏

关于似然最大化顶点提名方案的一致性:弥补极大似然估计与图匹配之间的差距

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

Vince Lyzinski, Keith Levin, Donniell E. Fishkind, Carey E. Priebe

摘要:

给定一个图,其中一些顶点被认为是先验感兴趣的,顶点提名任务是将剩余的顶点排序到提名列表中,使得感兴趣的顶点集中在列表的顶部。以前的工作已经产生了几种方法来解决这个问题,与理论结果的设置中的图形是从一个随机块模型(SBM),包括顶点提名模拟贝叶斯最优分类。在本文中,我们证明了极大似然(ML)为基础的顶点提名是一致的,在这个意义上的ML为基础的计划的性能渐近匹配的贝叶斯最优方案。我们证明了这种形式的定理时,模型参数已知和未知。此外,我们介绍并证明了一个相关的,更具可扩展性的限制焦点ML顶点提名计划的一致性。最后,我们将顶点和边缘功能ML为基础的顶点提名,并简要探讨了这种方法的经验有效性。

英文摘要:

Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical results in the setting where the graph is drawn from a stochastic block model (SBM), including a vertex nomination analogue of the Bayes optimal classifier. In this paper, we prove that maximum likelihood (ML)-based vertex nomination is consistent, in the sense that the performance of the ML-based scheme asymptotically matches that of the Bayes optimal scheme. We prove theorems of this form both when model parameters are known and unknown. Additionally, we introduce and prove consistency of a related, more scalable restricted-focus ML vertex nomination scheme. Finally, we incorporate vertex and edge features into ML-based vertex nomination and briefly explore the empirical effectiveness of this approach.

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

↑