Biased Dynamic Sampling for Temporal Network Streams
Considering the avalanche of evolving data and the memory constraints, streaming networks’ sampling has gained much attention in the recent decade. However, samples choosing data uniformly from the beginning to the end of a temporal stream are not very relevant for temporally evolving networks where recent activities are more important than the old events. Moreover, the relationships also change overtime. Recent interactions are evident to show the current status of relationships, nevertheless some old stronger relations are also substantially significant. Considering the above issues we propose a fast memory less dynamic sampling mechanism for weighted or multi-graph high-speed streams. For this purpose, we use a forgetting function with two parameters that help introduce biases on the network based on time and relationship strengths. Our experiments on real-world data sets show that our samples not only preserve the basic properties like degree distributions but also maintain the temporal distribution correlations. We also observe that our method generates samples with increased efficiency. It also outperforms current sampling algorithms in the area.
This research was carried out in the framework of the project TEC4Growth – RL SMILES – Smart, mobile, Intelligent and Large Scale Sensing and analytics NORTE-01-0145-FEDER-000020 which is financed by the north Portugal regional operational program NORTE 2020 and partly funded by PRODEI program, Faculdade de Engenharia, Universidade do Porto.
- 1.Aggarwal, C.C.: On biased reservoir sampling in the presence of stream evolution. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 607–618. VLDB Endowment (2006)Google Scholar
- 2.Ahmed, N.K., Duffield, N., Willke, T.L., Rossi, R.A.: On sampling from massive graph streams. Proc. VLDB Endow. 10(11), 1430–1441 (2017)Google Scholar
- 3.Ahmed, N.K., Neville, J., Kompella, R.: Network sampling: from static to streaming graphs. ACM Trans. Knowl. Discov. Data (TKDD) 8(2), 7 (2014)Google Scholar
- 4.Chen, H.H., Miller, D.J., Giles, C.L.: The predictive value of young and old links in a social network. In: Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks, pp. 43–48. ACM (2013)Google Scholar
- 5.Krackhardt, D.: Graph theoretical dimensions of informal organizations. In: Computational Organization Theory, pp. 107–130. Psychology Press (2014)Google Scholar
- 6.Panzarasa, P., Opsahl, T., Carley, K.M.: Patterns and dynamics of users’ behavior and interaction: network analysis of an online community. J. Am. Soc. Inf. Sci. Technol. 60(5), 911–932 (2009)Google Scholar
- 7.Papagelis, M., Das, G., Koudas, N.: Sampling online social networks. IEEE Trans. Knowl. Data Eng. 25(3), 662–676 (2013)Google Scholar
- 8.Tabassum, S., Gama, J.: Sampling evolving ego-networks with forgetting factor (2016)Google Scholar
- 9.Tabassum, S., Gama, J.: Sampling massive streaming call graphs. In: ACM Symposium on Advanced Computing, pp. 923–928 (2016)Google Scholar
- 10.Viswanath, B., Mislove, A., Cha, M., Gummadi, K.P.: On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 37–42. ACM (2009)Google Scholar
- 11.Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. (TOMS) 11(1), 37–57 (1985)Google Scholar
- 12.Zhang, J., Zhu, K., Pei, Y., Fletcher, G., Pechenizkiy, M.: Clustering-structure representative sampling from graph streams. In: International Workshop on Complex Networks and Their Applications, pp. 265–277. Springer (2017)Google Scholar