arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1503.02129cs.LGcs.AIstat.ML
收藏

基于动态节点度先验的无标度网络学习

Learning Scale-Free Networks by Dynamic Node-Specific Degree Prior

Toyota Technological Institute at Chicago(芝加哥丰田理工学院)

Qingming Tang, Siqi Sun, Jinbo Xu

摘要:

学习数据的网络结构是机器学习中的一个重要问题。无标度网络广泛应用于社会网络和生物网络的建模,本文介绍了一种新的无标度网络的推理方法。先验不仅有利于一个理想的全球节点度分布,但也考虑到所有可能的边缘相邻于同一个节点的相对强度和每个单独的节点的估计度。为了实现这一点,排名被纳入先验,这使得问题具有挑战性的解决。我们采用ADMM(交替方向方法的乘数)框架来解决高斯图模型正则化的先验。我们在合成数据和真实数据上的实验表明,我们的先验不仅产生了一个无标度网络,而且产生了更多的正确预测的边缘比其他人,如无标度诱导先验,枢纽诱导先验和$l_1$规范。

英文摘要:

Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks. The prior not only favors a desirable global node degree distribution, but also takes into consideration the relative strength of all the possible edges adjacent to the same node and the estimated degree of each individual node. To fulfill this, ranking is incorporated into the prior, which makes the problem challenging to solve. We employ an ADMM (alternating direction method of multipliers) framework to solve the Gaussian Graphical model regularized by this prior. Our experiments on both synthetic and real data show that our prior not only yields a scale-free network, but also produces many more correctly predicted edges than the others such as the scale-free inducing prior, the hub-inducing prior and the $l_1$ norm.

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

↑