Abstract
The structure of the network in the real world is very complex, as the dynamic network structure evolves in time dimension, how to detect network changes accurately and further locate abnormal nodes is a research hotspot. Most current feature learning methods are difficult to capture a variety of network connectivity patterns, and have a high time complexity. In order to overcome this limitation, we introduce the network embedding method into the field of network change detection, we find that node-based egonet can better reflect the connectivity patterns of the node, so a dynamic network embedding model Egonet2Vec is proposed, which is based on extracting the connectivity patterns of the node-based egonets. After the dynamic network representation learning, we use a dynamic network change detection strategy to detect network change time points and locate abnormal nodes. We apply our method to real dynamic network datasets to demonstrate the validity of this method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Berlingerio, M., Koutra, D., Eliassirad, T., et al.: NetSimile: a scalable approach to size-independent network similarity. Comput. Sci. 12(1), 28:21–28:28 (2012)
Miz, V., Ricaud, B., Benzi, K., et al.: Anomaly detection in the dynamics of web and social networks (2019)
Yu, W., Cheng, W., Aggarwal, C.C., et al.: Netwalk: a flexible deep embedding approach for anomaly detection in dynamic networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2672–2681. ACM (2018)
Sun, J., Faloutsos, C., Faloutsos, C., et al.: GraphScope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 687–696. ACM (2007)
Mikolov, T., Sutskever, I., Kai, C., et al.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, vol. 26, pp. 3111–3119 (2013)
Le, Q., Mikolov, T.: Distributed representations of sentences and documents. In: Proceedings of the International Conference on Machine Learning, pp. 1188–1196 (2014)
Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2014)
Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2016)
Jian, T., Meng, Q., Wang, M., et al.: LINE: large-scale information network embedding (2015)
Narayanan, A., Chandramohan, M., Chen, L., et al.: subgraph2vec: learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:160608928 (2016)
Narayanan, A., Chandramohan, M., Venkatesan, R., et al.: graph2vec: learning distributed representations of graphs (2017)
Nguyen, D., Luo, W., Nguyen, T.D., et al.: Learning graph representation via frequent subgraphs. In: Proceedings of the Proceedings of the 2018 SIAM International Conference on Data Mining. SIAM, pp. 306–314 (2018)
Priebe, C.E., Conroy, J.M., Marchette, D.J., Park, Y.: Scan statistics on enron graphs. Comput. Math. Organ. Theory 11(3), 229–247 (2005)
Views R. University of Oregon route views project [EB/OL]. http://www.routerviews.org/
BGPMon [EB/OL]. https://www.bgpmon.net/internet-outage-in-lebanon-continues-for-days/
CNN[EB/OL]. https://edition.cnn.com/2019/03/08/americas/venezuela-blackout-power-intl/index.html
Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proceedings of the IEEE International Conference on Data Mining, vol. 721 (2002)
Araujo, M., et al.: Com2: fast automatic discovery of temporal (‘Comet’) communities. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS (LNAI), vol. 8444, pp. 271–283. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-06605-9_23
Peel, L., Clauset, A.: Detecting change points in the large-scale structure of evolving networks. CoRR, abs/1403.0989 (2014)
Mongiovi, M., Bogdanov, P., Ranca, R., Singh, A.K., Papalexakis, E.E., Faloutsos, C.: NetSpot: spotting significant anomalous regions on dynamic networks. In: Proceedings of the 13th SIAM International Conference on Data Mining (SDM), Texas, Austin, TX (2013)
Acknowledgment
This work was supported by the National Key R&D Program of China (No. 2016YFB0801303, 2016QY01W0105), the National Natural Science Foundation of China (No.61309007, U1636219, 61602508, 61772549, U1736214, 61572052) and Plan for Scientific Innovation Talent of Henan Province (No. 2018JR0018).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Feng, H., Liu, Y., Zhou, Z., Chen, J. (2020). Dynamic Network Change Detection via Dynamic Network Representation Learning. In: Gao, H., Feng, Z., Yu, J., Wu, J. (eds) Communications and Networking. ChinaCom 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 312. Springer, Cham. https://doi.org/10.1007/978-3-030-41114-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-030-41114-5_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41113-8
Online ISBN: 978-3-030-41114-5
eBook Packages: Computer ScienceComputer Science (R0)