3.9 Article

Probabilistic graphical models in modern social network analysis

期刊

出版社

SPRINGER WIEN
DOI: 10.1007/s13278-015-0289-6

关键词

Probabilistic graphical modeling; Social network analysis; Bayesian networks; Markov networks; Exponential random graph models; Markov logic networks; Social influence; Network sampling

资金

  1. MURI grant [W911NF-09-1-0392]
  2. US Army Research Office (ARO)
  3. Academy of Finland [268078]
  4. U.S. Air Force Summer Faculty Fellowship Program - Air Force Office of Scientific Research
  5. NSF [DMS 1312250]
  6. Direct For Mathematical & Physical Scien
  7. Division Of Mathematical Sciences [1312250] Funding Source: National Science Foundation

向作者/读者索取更多资源

The advent and availability of technology has brought us closer than ever through social networks. Consequently, there is a growing emphasis on mining social networks to extract information for knowledge and discovery. However, methods for social network analysis (SNA) have not kept pace with the data explosion. In this review, we describe directed and undirected probabilistic graphical models (PGMs), and highlight recent applications to social networks. PGMs represent a flexible class of models that can be adapted to address many of the current challenges in SNA. In this work, we motivate their use with simple and accessible examples to demonstrate the modeling and connect to theory. In addition, recent applications in modern SNA are highlighted, including the estimation and quantification of importance, propagation of influence, trust (and distrust), link and profile prediction, privacy protection, and news spread through microblogging. Applications are selected to demonstrate the flexibility and predictive capabilities of PGMs in SNA. Finally, we conclude with a discussion of challenges and opportunities for PGMs in social networks.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.9
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据