{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:09:11Z","timestamp":1774627751380,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T00:00:00Z","timestamp":1473292800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10994-016-5583-7","type":"journal-article","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T19:17:55Z","timestamp":1473362275000},"page":"1133-1169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Scalable computational techniques for centrality metrics on temporally detailed social network"],"prefix":"10.1007","volume":"106","author":[{"given":"Venkata M. V.","family":"Gunturi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"Joseph","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathleen M.","family":"Carley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"issue":"2","key":"5583_CR1","first-page":"119","volume":"52","author":"A Agresti","year":"1998","unstructured":"Agresti, A., & Coull, B. A. (1998). Approximate is better than \u201cexact\u201d for interval estimation of binomial proportions. The American Statistician, 52(2), 119\u2013126.","journal-title":"The American Statistician"},{"key":"5583_CR2","unstructured":"Anthonisse, J. M. (1971). The rush in a directed graph. CWI technical report Stichting Mathematisch Centrum. Mathematische Besliskunde-BN 9\/71, Stichting Mathematisch Centrum"},{"issue":"7039","key":"5583_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"AL Barab\u00e1si","year":"2005","unstructured":"Barab\u00e1si, A. L. (2005). The origin of bursts and heavy tails in human dynamics. Nature, 435(7039), 207\u2013211.","journal-title":"Nature"},{"key":"5583_CR4","volume-title":"Dynamic programming: Deterministic and stochastic models","author":"DP Bertsekas","year":"1987","unstructured":"Bertsekas, D. P. (1987). Dynamic programming: Deterministic and stochastic models. Englewood Cliffs, NJ: Prentice-Hall."},{"issue":"2","key":"5583_CR5","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.socnet.2005.05.001","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti, S. P., Carley, K. M., & Krackhardt, D. (2006). On the robustness of centrality measures under conditions of imperfect data. Social Networks, 28(2), 124\u2013136.","journal-title":"Social Networks"},{"issue":"2","key":"5583_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/cplx.20156","volume":"12","author":"D Braha","year":"2006","unstructured":"Braha, D., & Bar-Yam, Y. (2006). From centrality to temporary fame: Dynamic centrality in complex networks. Complexity, 12(2), 59\u201363.","journal-title":"Complexity"},{"issue":"2","key":"5583_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), 163\u2013177.","journal-title":"Journal of Mathematical Sociology"},{"issue":"4\u20135","key":"5583_CR8","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1177\/1461445605054407","volume":"7","author":"M Bucholtz","year":"2005","unstructured":"Bucholtz, M., & Hall, K. (2005). Identity and interaction: A sociocultural linguistic approach. Discourse Studies, 7(4\u20135), 585\u2013614.","journal-title":"Discourse Studies"},{"issue":"3\u20134","key":"5583_CR9","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s11067-014-9237-7","volume":"14","author":"O Cats","year":"2014","unstructured":"Cats, O., & Jenelius, E. (2014). Dynamic vulnerability analysis of public transport networks: Mitigation effects of real-time information. Networks and Spatial Economics, 14(3\u20134), 435\u2013463.","journal-title":"Networks and Spatial Economics"},{"key":"5583_CR10","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms. Cambridge: MIT Press."},{"key":"5583_CR11","unstructured":"Csardi, G., & Nepusz, T. (2006). The igraph software package for complex network research. InterJournal Complex Systems, 1695. URL http:\/\/igraph.sf.net ."},{"key":"5583_CR12","doi-asserted-by":"crossref","unstructured":"Delling, D. (2008). Time-dependent sharc-routing. In Proceedings of the 16th annual European symposium on Algorithms (pp 332\u2013343).","DOI":"10.1007\/978-3-540-87744-8_28"},{"key":"5583_CR13","doi-asserted-by":"crossref","unstructured":"Delling, D., & Nannicini, G. (2008). Bidirectional core-based routing in dynamic time-dependent road networks. In Proceedings of the 19th international symposium on algorithms and computation, ISAAC\u201908 (pp. 812\u2013823). Springer.","DOI":"10.1007\/978-3-540-92182-0_71"},{"key":"5583_CR14","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental algorithms","author":"D Delling","year":"2007","unstructured":"Delling, D., & Wagner, D. (2007). Landmark-based routing in dynamic graphs. Experimental algorithms (pp. 52\u201365). Berlin: Springer."},{"key":"5583_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and online large-scale optimization","author":"D Delling","year":"2009","unstructured":"Delling, D., & Wagner, D. (2009). Time-dependent route planning. Robust and online large-scale optimization (Vol. 5868, pp. 207\u2013230)., Lecture notes in computer science Berlin: Springer."},{"key":"5583_CR16","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C., & Ranganathan, A. (2011). Online computation of fastest path in time-dependent spatial networks. In: Proceedings of the 12th international conference on advances in spatial and temporal databases, SSTD\u201911 (pp. 92\u2013111) Springer.","DOI":"10.1007\/978-3-642-22922-0_7"},{"key":"5583_CR17","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J. X., & Qin, L. (2008). Finding time-dependent shortest paths over large graphs. In Proceedings of the 11th international conference on extending database technology (EDBT) (pp 205\u2013216).","DOI":"10.1145\/1353343.1353371"},{"issue":"40","key":"5583_CR18","doi-asserted-by":"crossref","first-page":"14333","DOI":"10.1073\/pnas.0405728101","volume":"101","author":"JP Eckmann","year":"2004","unstructured":"Eckmann, J. P., Moses, E., & Sergi, D. (2004). Entropy of dialogues creates coherent structures in e-mail traffic. Proceedings of National Academy of Sciences, 101(40), 14333\u201314337.","journal-title":"Proceedings of National Academy of Sciences"},{"issue":"4","key":"5583_CR19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10588-009-9063-5","volume":"15","author":"TL Frantz","year":"2009","unstructured":"Frantz, T. L., Cataldo, M., & Carley, K. M. (2009). Robustness of centrality measures under uncertainty: Examining the role of network topology. Computational and Mathematical Organization Theory, 15(4), 303\u2013328.","journal-title":"Computational and Mathematical Organization Theory"},{"issue":"3","key":"5583_CR20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L Freeman","year":"1979","unstructured":"Freeman, L. (1979). Centrality in social networks conceptual clarification. Social Networks, 1(3), 215\u2013239.","journal-title":"Social Networks"},{"key":"5583_CR21","doi-asserted-by":"crossref","unstructured":"George, B., Kim, S., & Shekhar, S. (2007). Spatio-temporal network databases and routing algorithms: A summary of results. In: Symposium on spatial and temporal databases (SSTD) (pp. 460\u2013477).","DOI":"10.1007\/978-3-540-73540-3_26"},{"key":"5583_CR22","first-page":"191","volume":"11","author":"B George","year":"2007","unstructured":"George, B., & Shekhar, S. (2007). Time-aggregated graphs for modelling spatio-temporal networks. Journal on Data Semantics, 11, 191.","journal-title":"Journal on Data Semantics"},{"key":"5583_CR23","unstructured":"Habiba, H., Tantipathananandh, C., & Berger-Wolf, T. Y. (2007). Betweenness centrality measure in dynamic networks. Technical report 2007\u201319, Center for Discrete Mathematics and Theoretical Computer Science."},{"issue":"1","key":"5583_CR24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0378-8733(94)00248-9","volume":"17","author":"P Hage","year":"1995","unstructured":"Hage, P., & Harary, F. (1995). Eccentricity and centrality in networks. Social Networks, 17(1), 57\u201363.","journal-title":"Social Networks"},{"issue":"12","key":"5583_CR25","doi-asserted-by":"crossref","first-page":"767","DOI":"10.17705\/1jais.00282","volume":"12","author":"J Howison","year":"2011","unstructured":"Howison, J., Wiggins, A., & Crowston, K. (2011). Validity issues in the use of social network analysis with digital trace data. Journal of the Association for Information Systems, 12(12), 767.","journal-title":"Journal of the Association for Information Systems"},{"key":"5583_CR26","doi-asserted-by":"crossref","unstructured":"Johnson, R., Kovcs, B., & Vicsek, A. (2012). A comparison of email networks and off-line social networks: A study of a medium-sized bank. Social Networks, 34(4), 462\u2013469.","DOI":"10.1016\/j.socnet.2012.02.004"},{"key":"5583_CR27","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., & Zhang, D. (2006). Finding fastest paths on a road network with speed patterns. In Proceedings of the 22nd international conference on data engineering (ICDE) (p. 10).","DOI":"10.1109\/ICDE.2006.71"},{"issue":"2","key":"5583_CR28","doi-asserted-by":"crossref","first-page":"026107","DOI":"10.1103\/PhysRevE.85.026107","volume":"85","author":"H Kim","year":"2012","unstructured":"Kim, H., & Anderson, R. (2012). Temporal node centrality in complex networks. Physcial Review E, 85(2), 026107.","journal-title":"Physcial Review E"},{"issue":"3","key":"5583_CR29","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.comnet.2011.10.022","volume":"56","author":"H Kim","year":"2012","unstructured":"Kim, H., Tang, J., Anderson, R., & Mascolo, C. (2012). Centrality prediction in dynamic human contact networks. Computer Networks, 56(3), 983\u2013996.","journal-title":"Computer Networks"},{"issue":"1","key":"5583_CR30","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1140\/epjb\/e2007-00033-7","volume":"55","author":"PJ Kim","year":"2007","unstructured":"Kim, P. J., & Jeong, H. (2007). Reliability of rank order in sampled networks. The European Physical Journal B-Condensed Matter and Complex Systems, 55(1), 109\u2013114.","journal-title":"The European Physical Journal B-Condensed Matter and Complex Systems"},{"key":"5583_CR31","doi-asserted-by":"crossref","unstructured":"Kossinets, G., Kleinberg, J., & Watts, D. (2008). The structure of information pathways in a social communication network. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201908 (pp. 435\u2013443).","DOI":"10.1145\/1401890.1401945"},{"issue":"5757","key":"5583_CR32","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets, G., & Watts, D. J. (2006). Empirical analysis of an evolving social network. Science, 311(5757), 88\u201390.","journal-title":"Science"},{"key":"5583_CR33","doi-asserted-by":"crossref","unstructured":"Lerman, K., Ghosh, R., & Kang, J. H. (2010). Centrality metric for dynamic network analysis. In Proceedings of KDD workshop on mining and learning with graphs (MLG)","DOI":"10.1145\/1830252.1830262"},{"key":"5583_CR34","doi-asserted-by":"crossref","unstructured":"Malmgren, R. D., Hofman, J. M., Amaral, L. A., & Watts, D. J. (2009). Characterizing individual communication patterns. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201909 (pp. 607\u2013616). New York, NY, USA: ACM.","DOI":"10.1145\/1557019.1557088"},{"key":"5583_CR35","doi-asserted-by":"crossref","first-page":"18153","DOI":"10.1073\/pnas.0800332105","volume":"105","author":"RD Malmgren","year":"2008","unstructured":"Malmgren, R. D., Stouffer, D. B., Motter, A. E., & Amaral, L. A. N. (2008). A poissonian explanation for heavy tails in e-mail communication. Proceedings of the National Academy of Sciences, 105, 18153\u201318158.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"5583_CR36","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-540-68552-4_25","volume-title":"Experimental algorithms","author":"G Nannicini","year":"2008","unstructured":"Nannicini, G., Delling, D., Liberti, L., & Schultes, D. (2008). Bidirectional a* search for time-dependent fast paths. Experimental algorithms (pp. 334\u2013346). Berlin: Springer."},{"issue":"2","key":"5583_CR37","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1002\/net.20438","volume":"59","author":"G Nannicini","year":"2012","unstructured":"Nannicini, G., Delling, D., Schultes, D., & Liberti, L. (2012). Bidirectional a* search on time-dependent road networks. Networks, 59(2), 240\u2013251.","journal-title":"Networks"},{"key":"5583_CR38","doi-asserted-by":"crossref","unstructured":"Nia, R., Bird, C., Devanbu, P., & Filkov, V. (2010). Validity of network analyses in open source projects. In 2010 7th IEEE working conference on mining software repositories (MSR) (pp 201\u2013209).","DOI":"10.1109\/MSR.2010.5463342"},{"issue":"1","key":"5583_CR39","first-page":"73","volume":"69","author":"LA Palinkas","year":"1998","unstructured":"Palinkas, L. A., Johnson, J. C., Boster, J. S., & Houseal, M. (1998). Longitudinal studies of behavior and performance during a winter at the South Pole. Aviation, Space, and Environmental Medicine, 69(1), 73\u201377.","journal-title":"Aviation, Space, and Environmental Medicine"},{"key":"5583_CR40","volume-title":"Artificial intelligence: A morden approach","author":"S Russel","year":"1995","unstructured":"Russel, S., & Norwig, P. (1995). Artificial intelligence: A morden approach. Upper Saddle River, NJ: Prentice-Hall."},{"issue":"4","key":"5583_CR41","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi, G. (1966). The centrality index of a graph. Psychometrika, 31(4), 581\u2013603.","journal-title":"Psychometrika"},{"key":"5583_CR42","unstructured":"Sampson, S. F. (1968). A novitiate in a period of change: An experimental and case study of social relationships. Ph.D. thesis, Cornell University."},{"issue":"4","key":"5583_CR43","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF02476438","volume":"15","author":"A Shimbel","year":"1953","unstructured":"Shimbel, A. (1953). Structural parameters of communication networks. The Bulletin of Mathematical Biophysics, 15(4), 501\u2013507.","journal-title":"The Bulletin of Mathematical Biophysics"},{"issue":"2","key":"5583_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.21307\/joss-2019-028","volume":"13","author":"L Tambayong","year":"2012","unstructured":"Tambayong, L., & Carley, K. M. (2012). Network text analysis in computer-intensive rapid ethnography retrieval: An example from political networks of sudan. Journal of Social Structure, 13(2), 1\u201324.","journal-title":"Journal of Social Structure"},{"key":"5583_CR45","doi-asserted-by":"crossref","unstructured":"Tang, J., Musolesi, M., Mascolo, C., & Latora, V. (2009). Temporal distance metrics for social network analysis. In Proceedings of the 2Nd ACM workshop on online social networks, WOSN \u201909 (pp. 31\u201336). New York, NY, USA: ACM.","DOI":"10.1145\/1592665.1592674"},{"key":"5583_CR46","doi-asserted-by":"crossref","unstructured":"Tang, J., Musolesi, M., Mascolo, C., Latora, V., & Nicosia, V. (2010). Analysing information flows and key mediators through temporal centrality metrics. In Proceedings of the 3rd workshop on social network systems, SNS \u201910 (pp. 3:1\u20133:6).","DOI":"10.1145\/1852658.1852661"},{"issue":"4","key":"5583_CR47","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1353\/sof.2010.0009","volume":"88","author":"S Vaisey","year":"2010","unstructured":"Vaisey, S., & Lizardo, O. (2010). Can cultural worldviews influence network composition? Social Forces, 88(4), 1595\u20131618.","journal-title":"Social Forces"},{"key":"5583_CR48","doi-asserted-by":"crossref","unstructured":"Wang, D., Wen, Z., Tong, H., Lin, C. Y., Song, C., & Barabsi, A. L. (2011). Information spreading in context. In Proceedings of the 20th international conference on world wide web, WWW \u201911 (p. 735\u2013744) ACM.","DOI":"10.1145\/1963405.1963508"},{"key":"5583_CR49","unstructured":"Wei, W., & Carley, K. M. (2014). Real time closeness and betweenness centrality calculations on streaming network data. In ASE BIGDATA\/SOCIALCOM\/CYBERSECURITY conference."},{"key":"5583_CR50","first-page":"9","volume":"10","author":"W Wei","year":"2015","unstructured":"Wei, W., & Carley, K. M. (2015). Measuring temporal patterns in dynamic social networks. ACM Transactions on Knowledge Discovery from Data, 10, 9.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"5583_CR51","doi-asserted-by":"crossref","unstructured":"Weng, L., Flammini, A., Vespignani, A., & Menczer, F. (2012). Competition among memes in a world with limited attention. Scientific Reports, 2, 335.","DOI":"10.1038\/srep00335"},{"issue":"45","key":"5583_CR52","doi-asserted-by":"crossref","first-page":"17599","DOI":"10.1073\/pnas.0704916104","volume":"104","author":"F Wu","year":"2007","unstructured":"Wu, F., & Huberman, B. A. (2007). Novelty and collective attention. Proceedings of the National Academy of Science USA, 104(45), 17599\u201317601.","journal-title":"Proceedings of the National Academy of Science USA"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-016-5583-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5583-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5583-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T23:22:38Z","timestamp":1657236158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-016-5583-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,8]]},"references-count":52,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["5583"],"URL":"https:\/\/doi.org\/10.1007\/s10994-016-5583-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,8]]}}}