贝叶斯顶点提名
Bayesian Vertex Nomination
摘要:
考虑一个属性图,其顶点被着色为绿色或红色,但只有少数被观察到是红色的。其他顶点的颜色不可见。通常,未知的红色顶点总数很小。顶点指定问题是指定一个未观察到的顶点为红色。图的边集是无序顶点对集合的子集。假设每个边也被着色为绿色或红色,并且这对所有边都是可见的。一个顶点的上下文统计量被定义为连接到它的观察到的红色顶点的数量,它的内容统计量是入射到它的红色边的数量。假设这些统计量在顶点之间是独立的,并且红色边更可能在红色顶点之间,Coppermith和Priebe(2012)提出了一个基于这些统计量的似然模型。在这里,我们制定了一个贝叶斯模型使用建议的可能性与先验分布选择的未知参数和未观察到的顶点颜色。根据得到的后验分布,指定顶点是红色的后验概率后验概率最高的顶点。推理是使用一个大都市内吉布斯算法,并通过仿真研究说明了性能。结果表明:(i)贝叶斯模型的表现明显优于机会;(ii)正确提名的概率随着提名顶点为红色的后验概率的增加而增加;(iii)贝叶斯模型与Coppermith和Priebe的方法匹配或表现更好。一个应用程序的例子是使用安然电子邮件语料库,其中顶点代表安然员工和他们的同事,观察到的红色顶点是已知的欺诈者,红色的边缘代表电子邮件通信被认为是欺诈,我们希望确定一个潜在的顶点最有可能是一个欺诈者。
英文摘要:
Consider an attributed graph whose vertices are colored green or red, but only a few are observed to be red. The color of the other vertices is unobserved. Typically, the unknown total number of red vertices is small. The vertex nomination problem is to nominate one of the unobserved vertices as being red. The edge set of the graph is a subset of the set of unordered pairs of vertices. Suppose that each edge is also colored green or red and this is observed for all edges. The context statistic of a vertex is defined as the number of observed red vertices connected to it, and its content statistic is the number of red edges incident to it. Assuming that these statistics are independent between vertices and that red edges are more likely between red vertices, Coppersmith and Priebe (2012) proposed a likelihood model based on these statistics. Here, we formulate a Bayesian model using the proposed likelihood together with prior distributions chosen for the unknown parameters and unobserved vertex colors. From the resulting posterior distribution, the nominated vertex is the one with the highest posterior probability of being red. Inference is conducted using a Metropolis-within-Gibbs algorithm, and performance is illustrated by a simulation study. Results show that (i) the Bayesian model performs significantly better than chance; (ii) the probability of correct nomination increases with increasing posterior probability that the nominated vertex is red; and (iii) the Bayesian model either matches or performs better than the method in Coppersmith and Priebe. An application example is provided using the Enron email corpus, where vertices represent Enron employees and their associates, observed red vertices are known fraudsters, red edges represent email communications perceived as fraudulent, and we wish to identify one of the latent vertices as most likely to be a fraudster.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。