arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.08351cs.SIphysics.soc-ph
收藏

用于链接预测的多重图关联规则

Multiplex Graph Association Rules for Link Prediction

Michele Coscia, Michael Szell

摘要:

多重网络使我们能够研究各种复杂的系统,其中节点以多种方式相互连接,例如社交网络中的朋友,家人和同事关系。链接预测是网络分析的一个分支,它允许我们预测网络的未来状态:哪些新的连接最有可能在未来出现?在多路复用链接预测中,我们还问:哪种类型的?因为这最后一个问题是无法回答与经典的链接预测,在这里,我们研究使用图关联规则通知多路链接预测。我们通过多重图挖掘识别网络中的所有频繁模式来获得这些规则,然后通过找到原始网络中每个规则的出现次数来对每个未观察到的链接的可能性进行评分。关联规则为多路链接预测增加了新的能力:预测新的节点到达,考虑具有四个或更多节点的高阶结构,以及内存效率。在我们的实验中,我们表明,利用图关联规则,我们能够实现接近理想的集成分类器的预测性能。此外,我们进行了一个案例研究,签署的多重网络,显示图关联规则可以提供有价值的见解,以扩展社会平衡理论。

英文摘要:

Multiplex networks allow us to study a variety of complex systems where nodes connect to each other in multiple ways, for example friend, family, and co-worker relations in social networks. Link prediction is the branch of network analysis allowing us to forecast the future status of a network: which new connections are the most likely to appear in the future? In multiplex link prediction we also ask: of which type? Because this last question is unanswerable with classical link prediction, here we investigate the use of graph association rules to inform multiplex link prediction. We derive such rules by identifying all frequent patterns in a network via multiplex graph mining, and then score each unobserved link's likelihood by finding the occurrences of each rule in the original network. Association rules add new abilities to multiplex link prediction: to predict new node arrivals, to consider higher order structures with four or more nodes, and to be memory efficient. In our experiments, we show that, exploiting graph association rules, we are able to achieve a prediction performance close to an ideal ensemble classifier. Further, we perform a case study on a signed multiplex network, showing how graph association rules can provide valuable insights to extend social balance theory.

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

↑