| 本文已被：浏览 5347次 下载 8610次 |
码上扫一扫！ |
|
|
| 稀疏可交换图建模研究综述 |
|
于千城1,2,3, 於志文1,2, 王柱1,2, 王晓峰3
|
|
1.西北工业大学 计算机学院, 陕西 西安 710072;2.陕西省嵌入式系统技术重点实验室(西北工业大学), 陕西 西安 710072;3.北方民族大学 计算机学院, 宁夏 银川 750021
|
|
| 摘要: |
| 可交换性假设是采用贝叶斯模型对网络数据建模的重要前提，基于Aldous-Hoover表示理论的可交换图不能生成稀疏网络.实证结果表明，真实世界中的很多复杂网络都具有节点度幂律分布的稀疏特征，基于Kallenberg表示理论的可交换图能够同时满足可交换性和稀疏性.以Caron-Fox模型和Graphex模型为例，对稀疏可交换图建模的相关概念、理论和方法的研究发展进行了综述.首先讨论了随机图、贝叶斯非参数混合模型、可交换表示理论、Poisson点过程、离散非参数先验等理论的研究历程；然后介绍了Caron-Fox模型的表示；进而总结了进行稀疏可交换图的随机模拟所涉及的截断采样和边缘化采样方法；接下来综述了稀疏可交换图模型的后验推理技术；最后对稀疏可交换图建模的最新进展和研究前景做了介绍. |
| 关键词: 稀疏可交换图建模 Caron-Fox模型 Graphex模型 Kallenberg表示理论 完全随机测度 |
| DOI：10.13328/j.cnki.jos.005558 |
| 分类号: |
| 基金项目:国家自然科学基金（61332005，61725205，61402369，61462001，61762002）；国家重点基础研究发展计划（973）（2015 CB352401）；“计算机应用技术”宁夏自治区重点学科项目；北方民族大学校级科研项目（2014XBZ04） |
|
| Survey of Sparse Exchangeable Graph Modeling |
|
YU Qian-Cheng1,2,3, YU Zhi-Wen1,2, WANG Zhu1,2, WANG Xiao-Feng3
|
|
1.School of Computer Science, Northwestern Polytechnical University, Xi'an 710072, China;2.Shanxi Provincial Key Laboratory for embedded system(Northwestern Polytechnical University), Xi'an 710072, China;3.College of Computer, Beifang University of Nationalities, Yinchuan 750021, China
|
| Abstract: |
| Exchangeability is a key to model network data with Bayesian model. The Aldous-Hoover representation theorem based exchangeable graph model can't generate sparse network, while empirical studies of networks indicate that many real-world complex networks have a power-law degree distribution. Kallenberg representation theorem based exchangeable graph model can admit power-law behavior while retaining desirable exchangeability. This article offers an overview of the emerging literature on concept, theory and methods related to the sparse exchangeable graph model with the Caron-Fox model and the Graphex model as examples. First, developments of random graph models, Bayesian non-parametric mixture models, exchangeability representation theorem, Poisson point process, discrete non-parametric prior etc. are discussed. Next, the Caron-Fox model is introduced. Then, simulation of the sparse exchangeable graph model and related methods such as truncated sampler, and marginalized sampler are summarized. In addition, techniques of model posterior inference are viewed. Finally, state-of-the-art and the prospects for development of the sparse exchangeable graph model are demonstrated. |
| Key words: sparse exchangeable graph model Caron-Fox model Graphex model Kallenberg representation theorem complete random measure |
