Walk Prediction in Directed Networks

被引:0
|
作者
An, Chuankai [1 ]
O'Malley, A. James [2 ,3 ]
Rockmore, Daniel N. [1 ,4 ,5 ]
机构
[1] Dartmouth Coll, Dept Comp Sci, Hanover, NH 03755 USA
[2] Dartmouth Coll, Geisel Sch Med, Dept Biomed Data Sci, Lebanon, NH 03756 USA
[3] Dartmouth Coll, Geisel Sch Med, Dartmouth Inst Hlth Policy & Clin Practice, Lebanon, NH 03756 USA
[4] Dartmouth Coll, Dept Math, Hanover, NH 03755 USA
[5] Santa Fe Inst, External Fac, Santa Fe, NM 87501 USA
关键词
Information walk prediction; Network measures; Bayesian personalized ranking; Patient referral network; INFORMATION DIFFUSION; LINK-PREDICTION;
D O I
10.1007/978-3-030-05411-3_2
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper we consider the problem of directed and walk-specific spread of information in complex social networks. Traditional models tend to explain "explosive" information spreading on social media (e.g., Twitter) - a broadcast or epidemiological kind of model with a focus on the sequence of newly "infected" nodes generated from a source node to multiple targets. However, the process of (single-track) information flow, wherein there is a node-by-node (and not necessarily a newly visited node) trajectory of information transfer is also a common phenomenon. A key example of interest is the sequence of physician visits of a given patient (a referral sequence) in a physician network, wherein the patient is a carrier of information about treatment or disease. With this motivation in mind, we present a Bayesian Personalized Ranking (BPR) model to predict the next node on a walk of a given network navigator using features derived from network analysis. This problem is related to but different from the well-studied problem of link prediction. We apply our model to data from several years of U.S. patient referrals. We present experiments showing that the adoption of network-based features in the BPR framework improves hit-rate and mean percentile rank for next-node prediction.
引用
收藏
页码:15 / 27
页数:13
相关论文
共 50 条
  • [1] Sign prediction and community detection in directed signed networks based on random walk theory
    Hu, Baofang
    Wang, Hong
    Zheng, Yuanjie
    INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2019, 11 (02) : 200 - 209
  • [2] Search for Directed Networks by Different Random Walk Strategies
    Zhu Zi-Qi
    Jin Xiao-Ling
    Huang Zhi-Long
    CHINESE PHYSICS LETTERS, 2012, 29 (03)
  • [3] Non-backtracking walk centrality for directed networks
    Arrigo, Francesca
    Grindrod, Peter
    Higham, Desmond J.
    Noferini, Vanni
    JOURNAL OF COMPLEX NETWORKS, 2018, 6 (01) : 54 - 78
  • [4] Link prediction in directed social networks
    Schall D.
    Schall, Daniel (daniel.schall@gmail.com), 1600, Springer-Verlag Wien (04): : 1 - 14
  • [5] Correlations between structure and random walk dynamics in directed complex networks
    Costa, Luciano da Fontoura
    Sporns, Olaf
    Antiqueira, Lucas
    Nunes, Maria das Gracas Volpe
    Oliveira, Osvaldo N., Jr.
    APPLIED PHYSICS LETTERS, 2007, 91 (05)
  • [6] Link Prediction by Multiple Motifs in Directed Networks
    Liu, Yafang
    Li, Ting
    Xu, Xiaoke
    IEEE ACCESS, 2020, 8 : 174 - 183
  • [7] Weight Prediction for Variants of Weighted Directed Networks
    Nguyen, Dong Quan Ngoc
    Xing, Lin
    Lin, Lizhen
    2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2020, : 5156 - 5163
  • [8] Random Walk Based Location Prediction in Wireless Sensor Networks
    Jin, Zhaoyan
    Shi, Dianxi
    Wu, Quanyuan
    Yan, Huining
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2013,
  • [9] Finding communities in directed networks by PageRank random walk induced network embedding
    Lai, Darong
    Lu, Hongtao
    Nardini, Christine
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2010, 389 (12) : 2443 - 2454
  • [10] RWE: A Random Walk Based Graph Entropy for the Structural Complexity of Directed Networks
    Zhang, Chong
    Deng, Cheng
    Fu, Luoyi
    Wang, Xinbing
    Chen, Guihai
    Zhou, Lei
    Zhou, Chenghu
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2024, 11 (02): : 2264 - 2278