Abstract
Closeness centrality is often used to identify the top-k most prominent nodes in a network. Real networks, however, are rapidly evolving all the time, which results in the previous methods hard to adapt. A more scalable method that can immediately react to the dynamic network is demanding. In this paper, we endeavour to propose a filter and verification framework to handle such new trends in the large-scale network. We adopt several pruning methods to generate a much smaller candidate set so that bring down the number of necessary time-consuming calculations. Then we do verification on the subset; which is a much time efficient manner. To further speed up the filter procedure, we incremental update the influenced part of the data structure. Extensive experiments using real networks demonstrate its high scalability and efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182–209 (1985)
Olsen, P.W., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search. In: 2014 IEEE 30th International Conference on Data Engineering (ICDE), pp. 196–207 (2014)
Sariyuce, A.E., Kaya, K., Saule, E., Catalyurek, U.V.: Incremental algorithms for network management and analysis based on closeness centrality, arXiv preprint (2013). arXiv:1303.0422
Yen, C.C., Yeh, M.Y., Chen, M.S.: An efficient approach to updating closeness centrality and average path length in dynamic networks. In: 2013 IEEE 13th International Conference on Data Mining (ICDM), pp. 867–876. IEEE (2013)
Acknowledgments
This work was supported by Natural Science Foundation of China (No. 61170003).
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
Lin, Y., Zhang, J., Ying, Y., Hong, S., Li, H. (2016). FVBM: A Filter-Verification-Based Method for Finding Top-k Closeness Centrality on Dynamic Social Networks. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-45817-5_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45816-8
Online ISBN: 978-3-319-45817-5
eBook Packages: Computer ScienceComputer Science (R0)