基于链接预测算法的通用异常顶点检测
Generic Anomalous Vertices Detection Utilizing a Link Prediction Algorithm
摘要:
在过去的十年中,网络结构几乎渗透到我们生活的方方面面。这些网络中异常顶点的检测变得越来越重要,例如在暴露计算机网络入侵者或识别虚假在线评论中。在这项研究中,我们提出了一种新的无监督的两层元分类器,可以检测复杂网络中的不规则顶点,仅使用从网络拓扑结构中提取的特征。根据这样的推理,即具有许多不可能链接的顶点具有更高的异常可能性,我们在10个不同规模的网络上使用了我们的方法,从几十个学生的网络到拥有数百万用户的在线社交网络。在每种情况下,与其他流行的方法相比,我们能够以较低的假阳性率和较高的AUC识别异常顶点。此外,我们证明了该算法是有效的,在揭示假用户和披露最有影响力的人在社交网络。
英文摘要:
In the past decade, network structures have penetrated nearly every aspect of our lives. The detection of anomalous vertices in these networks has become increasingly important, such as in exposing computer network intruders or identifying fake online reviews. In this study, we present a novel unsupervised two-layered meta-classifier that can detect irregular vertices in complex networks solely by using features extracted from the network topology. Following the reasoning that a vertex with many improbable links has a higher likelihood of being anomalous,we employed our method on 10 networks of various scales, from a network of several dozen students to online social networks with millions of users. In every scenario, we were able to identify anomalous vertices with lower false positive rates and higher AUCs compared to other prevalent methods. Moreover, we demonstrated that the presented algorithm is efficient both in revealing fake users and in disclosing the most influential people in social networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。