Abstract
Social networks have become a “household name” for internet users. Identifying shortest paths between nodes in such networks is intrinsically important in reaching out to users on such networks. In this paper we propose an efficient algorithm that can scale up to large social networks. The algorithm iteratively constructs higher levels of hierarchical networks by condensing the central nodes and their neighbors into super nodes until a smaller network is realized. Shortest paths are approximated by corresponding super nodes of the newly constructed hierarchical network. Experimental results show an appreciable improvement over existing algorithms.
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
Similar content being viewed by others
References
Broido, A.: Internet topology: connectivity of IP networks. In: SPIE Conference on Scalability and Traffic Control in IP Networks, Denver, pp. 172–187 (2001)
Slivkins, A.: Distance estimation and object location via rings of neighbors. Distrib. Comput. 19, 313 (2007)
Klimmt, B., Yang, Y.: Introducing the Enron corpus. In: CEAS Conference (2004)
Chow, E.: A graph search heuristic for shortest distance paths. In: The Twentieth National Conference on Artificial Intelligence, Pittsburgh, PA, USA (2005)
Tang, J.T., Wang, T., Wang, J.: Shortest path approximate algorithm for complex network analysis. J. Softw. 22, 2279 (2011). (in Chinese)
Freeman, L.C.: Centrality in complex networks: conceptual clarification. Soc. Netw. 1, 215 (1979)
Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 867–876. ACM (2009)
Ley, M., Reuther, P.: Maintaining an online bibliographical database: the problem of data quality. In: EGC, pp. 5–10 (2006)
Rattigan, M., Maier, M.J., Jensen, D.: Using structure indices for efficient approximation of network properties. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 357–366. ACM (2006)
Qiao, S.J., Tang, C.J., Peng, J., Liu, W., Wen, F.L., Qiu, J.T.: Mining key members of crime networks based on personality trait simulation email analysis system. Chin. J. Comput. 31, 1795 (2008). (in Chinese)
Stolfo, S.J., Hershkop, S., Wang, K., Nimeskern, O., Hu, C.W.: Behavior profiling of email. In: Proceedings of the 1st NSF/NIJ Conference on Intelligence and Security Informatics, pp. 74–90 (2003)
Yang, Y.B., Li, N., Zhang, Y.: Networked data mining based on complex network visualizations. J. Softw. 19, 1980 (2008). (in Chinese)
Schwarzkopf, Y., Rákos, A., Mukamel, D.: Epidemic spreading in evolving networks. Phys. Rev. E 82, 036112 (2010)
Acknowledgments
This work was partially supported by the National Natural Science Foundation of China under Grant No. 61433014, by the National High Technology Research and Development Program under Grant No. 2015AA7115089.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Ayeh, M.D.N., Gao, H., Chen, D. (2018). An Approximation Algorithm for Shortest Path Based on the Hierarchical Networks. In: Satapathy, S., Joshi, A. (eds) Information and Communication Technology for Intelligent Systems (ICTIS 2017) - Volume 2. ICTIS 2017. Smart Innovation, Systems and Technologies, vol 84. Springer, Cham. https://doi.org/10.1007/978-3-319-63645-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-319-63645-0_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63644-3
Online ISBN: 978-3-319-63645-0
eBook Packages: EngineeringEngineering (R0)