Abstract
Historical disaster events are taken as a case for space-correlation analysis, three-dimensional disasters space-time complex network are modeled and chain relationship of disaster nodes are mined by looking for similar space vector in network. Then transformed the vector discover problem into a path optimization problem and solved by using ant colony algorithm, where the pheromone parameter in the process of optimal-path finding is concerned as the algorithm result, in order to solve the problem of path competition which existed when only to solve the optimal path. Experimental results of MATLAB show that this method has high accuracy and practicality.
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
Girvan, M., Newman, M.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 9(12), 7821–7826 (2002)
Newman, J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)
Guimerà , R., Amaral, L.: Functional cartography of complex metabolic networks. Nature 433(7028), 895–900 (2005)
Newman, J.: Detecting community structure in networks. Eur. Phys. J. B 38(2), 321–330 (2004)
Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Phys. Rev. E 72(2), 027104 (2005)
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 10, 10008 (2010)
Lü, Z., Huang, W.: Iterated tabu search for identifying community structure in complex networks. Phys. Rev. E 80(2), 026130 (2009)
Yang, B., Cheung, W., Liu, J.: Community mining from signed social networks. IEEE Trans. Knowl. Data Eng. 19(10), 1333–1348 (2007)
Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)
Raghavan, U., Albert, R., Kumara, S.: Near linear-time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)
Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci U.S.A. 104(18), 7327–7331 (2007)
Jin, D., Yang, B., Liu, J., Liu, D.: Ant colony optimization based on random walk for community detection in complex networks. J. Softw. 23(3), 451–464 (2012)
He, Z., Wang, J., Liu, S.: TSP-Chord: an improved chord model with physical topology awareness. In: 2012 International Conference on Information and Computer Networks, vol. 27, pp. 176–180 (2012)
Zachary, W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)
Lusseau, D.: The emergent properties of a dolphin social network. In: Proceedings of The Royal Society B. Biological Sciences, vol. 270, pp. 186–188 (2003)
Acknowledgment
This paper is sponsored by the National Natural Science Foundation of China (NSFC, Grant 61572447).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, S., Lv, GN., Feng, C. (2016). Event Space-Correlation Analysis Algorithm Based on Ant Colony Optimization. In: Huang, DS., Bevilacqua, V., Premaratne, P. (eds) Intelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Science(), vol 9771. Springer, Cham. https://doi.org/10.1007/978-3-319-42291-6_56
Download citation
DOI: https://doi.org/10.1007/978-3-319-42291-6_56
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42290-9
Online ISBN: 978-3-319-42291-6
eBook Packages: Computer ScienceComputer Science (R0)