Abstract
Predicting the evolution of a dynamic network—the addition of new edges and the removal of existing edges—is challenging. In part, this is because: (1) networks are often noisy; (2) various performance measures emphasize different aspects of prediction; and (3) it is not clear which network features are useful for prediction. To address these challenges, we develop a novel framework for robust dynamic network prediction using an adversarial formulation that leverages both edge-based and global network features to make predictions. We conduct experiments on five distinct dynamic network datasets to show the superiority of our approach compared to state-of-the-art methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Acar, E., Dunlavy, D.M., Kolda, T.G.: A scalable optimization approach for fitting canonical tensor decompositions. J. Chemom. 25(2), 67–86 (2011)
Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211–230 (2003)
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)
Asif, K., Xing, W., Behpour, S., Ziebart, B.D.: Adversarial cost-sensitive classification. In: International Conference on UAI (2015)
Bader, B.W., Kolda, T.G., et al.: MATLAB Tensor Toolbox Version 2.6. Available online, February 2015
Bringmann, B., Berlingerio, M., Bonchi, F., Gionis, A.: Learning and predicting the evolution of social networks. IEEE Intell. Syst. 25(4), 26–35 (2010)
Caceres, R.S., Berger-Wolf, T., Grossman, R.: Temporal scale of processes in dynamic networks. In: ICDMW, pp. 925–932. IEEE (2011)
Crofoot, M.C., Kays, R.W., Wikelski, M.: Data from: shared decision-making drives collective movement in wild baboons (2015)
Dunlavy, D.M., Kolda, T.G., Acar, E.: Temporal link prediction using matrix and tensor factorizations. TKDD 5(2), 10 (2011)
Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Pers. Ubiquit. Comput. 10(4), 255–268 (2006)
Gurobi Optimization, Inc.: Gurobi Optimizer Reference Manual (2015)
Hanneke, S., Fu, W., Xing, E.P., et al.: Discrete temporal models of social networks. Electron. J. Stat. 4, 585–605 (2010)
Holme, P., Saramäki, J. (eds.): Temporal Networks. Understanding Complex Systems. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36461-7
Huang, Z., Lin, D.K.: The time-series link prediction problem with applications in communication surveillance. INFORMS J. Comput. 21(2), 286–303 (2009)
Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.F., Van den Broeck, W.: What’s in a crowd? Analysis of face-to-face behavioral networks. J. Theor. Biol. 271(1), 166–180 (2011)
Kuchaiev, O., Stevanović, A., Hayes, W., Pržulj, N.: Graphcrunch 2: software tool for network modeling, alignment and clustering. BMC Bioinform. 12(1), 24 (2011)
Lahiri, M., Berger-Wolf, T.Y.: Structure prediction in temporal networks using frequent subgraphs. In: CIDM 2007, pp. 35–42. IEEE (2007)
Leifeld, P., Cranmer, S.J., Desmarais, B.A.: Temporal exponential random graph models with btergm: Estimation and bootstrap confidence intervals. J. Stat. Softw. (2015)
Leifeld, P., Cranmer, S.J., Desmarais, B.A.: btergm: Temporal exponential random graph models by bootstrapped pseudolikelihood. R Package v. 1.9.0 (2017)
Li, J., Asif, K., Wang, H., Ziebart, B.D., Berger-Wolf, T.: Adversarial sequence tagging. In: IJCAI (2016)
Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019–1031 (2007)
McMahan, H.B., Gordon, G.J., Blum, A.: Planning in the presence of cost functions controlled by an adversary. In: Proceedings of the ICML, pp. 536–543 (2003)
Nagrecha, S., Chawla, N.V., Bunke, H.: Recurrent subgraph prediction. In: Proceedings of the 2015 ASONAM, pp. 416–423. ACM (2015)
Parambath, S.P., Usunier, N., Grandvalet, Y.: Optimizing f-measures by cost-sensitive classification. In: Advances in NIPS, pp. 2123–2131 (2014)
Potgieter, A., April, K.A., Cooke, R.J., Osunmakinde, I.O.: Temporality in link prediction: understanding social complexity. Emerg.: Complex. Org. 11(1), 69 (2009)
Pujari, M., Kanawati, R.: Link prediction in complex networks by supervised rank aggregation. In: ICTAI 2012, vol. 1, pp. 782–789. IEEE (2012)
Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau, A.: CRAWDAD dataset cambridge/haggle (v. 2009-05-29). Downloaded from http://crawdad.org/cambridge/haggle/20090529. Accessed May 2009
Shi, Z., Zhang, X., Yu, Y.: Bregman divergence for stochastic variance reduction: saddle-point and adversarial prediction. In: Advances in Neural Information Processing Systems, pp. 6033–6043 (2017)
Strandburg-Peshkin, A., Farine, D.R., Couzin, I.D., Crofoot, M.C.: Shared decision-making drives collective movement in wild baboons. Science 348(6241), 1358–1361 (2015)
Wang, H., Xing, W., Asif, K., Ziebart, B.: Adversarial prediction games for multivariate losses. In: Advances in NIPS, pp. 2710–2718 (2015)
Yang, Y., Chawla, N.V., Basu, P., Prabhala, B., La Porta, T.: Link prediction in human mobility networks. In: ASONAM, pp. 380–387. IEEE (2013)
Yu, W., Cheng, W., Aggarwal, C.C., Chen, H., Wang, W.: Link prediction with spatial and temporal consistency in dynamic networks. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 3343–3349. AAAI Press (2017)
Zhu, L., Guo, D., Yin, J., Ver Steeg, G., Galstyan, A.: Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Trans. Knowl. Data Eng. 28(10), 2765–2777 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Li, J., Ziebart, B., Berger-Wolf, T. (2018). A Game-Theoretic Adversarial Approach to Dynamic Network Prediction. In: Phung, D., Tseng, V., Webb, G., Ho, B., Ganji, M., Rashidi, L. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2018. Lecture Notes in Computer Science(), vol 10939. Springer, Cham. https://doi.org/10.1007/978-3-319-93040-4_53
Download citation
DOI: https://doi.org/10.1007/978-3-319-93040-4_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93039-8
Online ISBN: 978-3-319-93040-4
eBook Packages: Computer ScienceComputer Science (R0)