Predicting the Evolution of Social Networks: Optimal Time Window Size for Increased Accuracy

This source preferred by Marcin Budka

Authors: Budka, M., Musial, K. and Juszczyszyn, K.

http://eprints.bournemouth.ac.uk/20436/

http://www.scopus.com/inward/record.url?eid=2-s2.0-84873654066&partnerID=40&md5=47fdc426236ae879ad10b74763d5b379

Pages: 21-30

DOI: 10.1109/SocialCom-PASSAT.2012.11

This data was imported from DBLP:

Authors: Budka, M., Musial, K. and Juszczyszyn, K.

http://eprints.bournemouth.ac.uk/20436/

http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6403618

Journal: SocialCom/PASSAT

Pages: 21-30

Publisher: IEEE

ISBN: 978-1-4673-5638-1

DOI: 10.1109/SocialCom-PASSAT.2012.11

This data was imported from Scopus:

Authors: Budka, M., Musial, K. and Juszczyszyn, K.

http://eprints.bournemouth.ac.uk/20436/

Journal: Proceedings - 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing, SocialCom/PASSAT 2012

Pages: 21-30

ISBN: 9780769548487

DOI: 10.1109/SocialCom-PASSAT.2012.11

This study investigates the data preparation process for predictive modelling of the evolution of complex networked systems, using an e - mail based social network as an example. In particular, we focus on the selection of optimal time window size for building a time series of network snapshots, which forms the input of chosen predictive models. We formulate this issue as a constrained multi - objective optimization problem, where the constraints are specific to a particular application and predictive algorithm used. The optimization process is guided by the proposed Windows Incoherence Measures, defined as averaged Jensen-Shannon divergences between distributions of a range of network characteristics for the individual time windows and the network covering the whole considered period of time. The experiments demonstrate that the informed choice of window size according to the proposed approach allows to boost the prediction accuracy of all examined prediction algorithms, and can also be used for optimally defining the prediction problems if some flexibility in their definition is allowed. © 2012 IEEE.

This data was imported from Web of Science (Lite):

Authors: Budka, M., Musial, K., Juszczyszyn, K. and IEEE

http://eprints.bournemouth.ac.uk/20436/

Journal: PROCEEDINGS OF 2012 ASE/IEEE INTERNATIONAL CONFERENCE ON PRIVACY, SECURITY, RISK AND TRUST AND 2012 ASE/IEEE INTERNATIONAL CONFERENCE ON SOCIAL COMPUTING (SOCIALCOM/PASSAT 2012)

Pages: 21-30

ISBN: 978-1-4673-5638-1

DOI: 10.1109/SocialCom-PASSAT.2012.11

The data on this page was last updated at 04:42 on September 20, 2017.