Link prediction based on Subgraph evolution in dynamic social networks
Authors: Juszczyszyn, K., Musiał, K. and Budka, M.
Journal: Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011
Pages: 27-34
ISBN: 9780769545783
DOI: 10.1109/PASSAT/SocialCom.2011.15
Abstract:We propose a new method for characterizing the dynamics of complex networks with its application to the link prediction problem. Our approach is based on the discovery of network subgraphs (in this study: triads of nodes) and measuring their transitions during network evolution. We define the Triad Transition Matrix (TTM) containing the probabilities of transitions between triads found in the network, then we show how it can help to discover and quantify the dynamic patterns of network evolution. We also propose the application of TTM to link prediction with an algorithm (called TTM-predictor) which shows good performance, especially for sparse networks analyzed in short time scales. The future applications and research directions of our approach are also proposed and discussed. © 2011 IEEE.
https://eprints.bournemouth.ac.uk/18410/
Source: Scopus
Link prediction based on Subgraph evolution in dynamic social networks
Authors: Juszczyszyn, K., Musial, K. and Budka, M.
Pages: 27-34
DOI: 10.1109/PASSAT/SocialCom.2011.15
https://eprints.bournemouth.ac.uk/18410/
Source: Manual
Preferred by: Marcin Budka
Link Prediction Based on Subgraph Evolution in Dynamic Social Networks.
Authors: Juszczyszyn, K., Musial, K. and Budka, M.
Journal: SocialCom/PASSAT
Pages: 27-34
Publisher: IEEE Computer Society
ISBN: 978-1-4577-1931-8
DOI: 10.1109/PASSAT/SocialCom.2011.15
https://eprints.bournemouth.ac.uk/18410/
https://ieeexplore.ieee.org/xpl/conhome/6112285/proceeding
Source: DBLP
Link Prediction Based on Subgraph Evolution in Dynamic Social Networks
Authors: Juszczyszyn, K., Musial, K. and Budka, M.
Conference: 3rd IEEE International Conference on Social Computing
Abstract:We propose a new method for characterizing the dynamics of complex networks with its application to the link prediction problem. Our approach is based on the discovery of network subgraphs (in this study: triads of nodes) and measuring their transitions during network evolution. We define the Triad Transition Matrix (TTM) containing the probabilities of transitions between triads found in the network, then we show how it can help to discover and quantify the dynamic patterns of network evolution. We also propose the application of TTM to link prediction with an algorithm (called TTM-predictor) which shows good performance, especially for sparse networks analyzed in short time scales. The future applications and research directions of our approach are also proposed and discussed.
https://eprints.bournemouth.ac.uk/18410/
http://www.iisocialcom.org/conference/socialcom2011/
Source: BURO EPrints