{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:54:38Z","timestamp":1755838478135},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319269870"},{"type":"electronic","value":"9783319269894"}],"license":[{"start":{"date-parts":[[2015,12,17]],"date-time":"2015-12-17T00:00:00Z","timestamp":1450310400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-26989-4_10","type":"book-chapter","created":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T22:47:29Z","timestamp":1450219649000},"page":"239-261","source":"Crossref","is-referenced-by-count":8,"title":["Social Network Analysis in Streaming Call Graphs"],"prefix":"10.1007","author":[{"given":"Rui","family":"Sarmento","sequence":"first","affiliation":[]},{"given":"M\u00e1rcia","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio","family":"Cordeiro","sequence":"additional","affiliation":[]},{"given":"Shazia","family":"Tabassum","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Gama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Kompella, R.: Space-efficient sampling from social activity streams. In: Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications (BigMine 2012), pp. 53\u201360. ACM (2012)","DOI":"10.1145\/2351316.2351324"},{"key":"10_CR2","first-page":"196","volume-title":"Communications in Computer and Information Science","author":"Shweta Bansal","year":"2011","unstructured":"Bansal, S., Bhowmick, S., Paymal, P.: Fast community detection for dynamic complex networks. In: da, L.,\u00a0Costa, F., Evsukoff, A., Mangioni, G., Menezes, R. (eds.) Complex Networks, Communications in Computer and Information Science, vol. 116, pp. 196\u2013207. Springer, Berlin (2011)"},{"issue":"7039","key":"10_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"AL Barabasi","year":"2005","unstructured":"Barabasi, A.L.: The origin of bursts and heavy tails in human dynamics. Nature 435(7039), 207\u2013211 (2005)","journal-title":"Nature"},{"issue":"10","key":"10_CR4","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"Vincent D Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Statis. Mech.: Theory Exper. 2008(10), P10,008 (2008)","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"5","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170\u20131182 (1987)","journal-title":"Am. J. Sociol."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4419-8020-5_4","volume-title":"Learning in Non-Stationary Environments","author":"Abdelhamid Bouchachia","year":"2012","unstructured":"Bouchachia, A., Prossegger, M.: Incremental spectral clustering. In: Sayed-Mouchaweh, M., Lughofer, E. (eds.) Learning in Non-Stationary Environments, pp. 77\u201399. Springer, New York (2012)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), pp. 693\u2013703. Springer (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1), 249\u2013278 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms \u2014 ESA 2002","author":"Erik D. Demaine","year":"2002","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: Mohring, R., Raman, R. (eds.) Algorithms-ESA 2002, Lecture Notes in Computer Science, vol. 2461, pp. 348\u2013360. Springer, Berlin (2002)"},{"issue":"3\u20135","key":"10_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1979","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1979)","journal-title":"Soc. Netw."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Gama, J.: Knowledge Discovery from Data Streams, 1st edn. Chapman & Hall\/CRC (2010)","DOI":"10.1201\/EBK1439826119-c1"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1214\/aoms\/1177705148","volume":"32","author":"LA Goodman","year":"1961","unstructured":"Goodman, L.A.: Snowball sampling. Ann. Math. Statis. 32(1), 148\u2013170 (1961)","journal-title":"Ann. Math. Statis."},{"issue":"6","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1086\/226224","volume":"81","author":"M Granovetter","year":"1976","unstructured":"Granovetter, M.: Network sampling: some first steps. Am. J. Sociol. 81(6), 1267\u20131303 (1976)","journal-title":"Am. J. Sociol."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: Proceedings of the 2012 International Conference on Privacy, Security, Risk and Trust (PASSAT 2012) and 2012 International Conference on Social Computing (SocialCom 2012), pp. 11\u201320. IEEE Computer Society (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"issue":"10","key":"10_CR18","doi-asserted-by":"crossref","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"Steve Gregory","year":"2010","unstructured":"Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103,018 (2010)","journal-title":"New Journal of Physics"},{"key":"10_CR19","unstructured":"Hanneman, R.A., Riddle, M.: Introduction to Social Network Methods. University of California, Riverside, Riverside, CA, USA (2005). \n                  http:\/\/www.faculty.ucr.edu\/~hanneman\/nettext\/index.html"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Hubler, C., Kriegel, H.P., Borgwardt, K., Ghahramani, Z.: Metropolis algorithms for representative subgraph sampling. In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), pp. 283\u2013292. IEEE Computer Society (2008)","DOI":"10.1109\/ICDM.2008.124"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Kas, M., Carley, K.M., Carley, L.R.: Incremental closeness centrality for dynamically changing social networks. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013), pp. 1250\u20131258. IEEE Computer Society (2013)","DOI":"10.1145\/2492517.2500270"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Kas, M., Wachs, M., Carley, K.M., Carley, L.R.: Incremental algorithm for updating betweenness centrality in dynamically growing networks. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013), pp. 33\u201340. IEEE Computer Society (2013)","DOI":"10.1145\/2492517.2492533"},{"issue":"12","key":"10_CR23","doi-asserted-by":"publisher","first-page":"2130","DOI":"10.1109\/JPROC.2011.2169033","volume":"99","author":"N Kayastha","year":"2011","unstructured":"Kayastha, N., Niyato, D., Wang, P., Hossain, E.: Applications, architectures, and protocol design issues for mobile social networks: a survey. Proc. IEEE 99(12), 2130\u20132158 (2011)","journal-title":"Proc. IEEE"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-014-0220-6","volume":"4","author":"SS Khopkar","year":"2014","unstructured":"Khopkar, S.S., Nagi, R., Nikolaev, A.G., Bhembre, V.: Efficient algorithms for incremental all pairs shortest paths, closeness and betweenness in social network analysis. Soc. Netw. Anal. Min. 4(1), 1\u201320 (2014)","journal-title":"Soc. Netw. Anal. Min."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Kim, H., Anderson, R.: Temporal node centrality in complex networks. Phys. Rev. E 85(2), 026,107 (2012)","DOI":"10.1103\/PhysRevE.85.026107"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Kourtellis, N., Morales, G.D.F., Bonchi, F.: Scalable online betweenness centrality in evolving graphs. \n                  arXiv:1401.6981\n                  \n                 (2014)","DOI":"10.1109\/TKDE.2015.2419666"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Lee, M.J., Lee, J., Park, J.Y., Choi, R.H., Chung, C.W.: QUBE: a quick algorithm for updating betweenness centrality. In: Proceedings of the 21st International Conference on World Wide Web, pp. 351\u2013360. ACM (2012)","DOI":"10.1145\/2187836.2187884"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006), pp. 631\u2013636. ACM (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), pp. 346\u2013357. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El\u00a0Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: Proceedings of the 10th International Conference on Database Theory (ICDT 2005), pp. 398\u2013412. Springer (2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026,113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Nguyen, N.P., Dinh, T.N., Xuan, Y., Thai, M.T.: Adaptive algorithms for detecting community structure in dynamic social networks. In: Proceedings of the 2011 IEEE International Conference on Computer Communications (INFOCOM 2011), pp. 2282\u20132290. IEEE Computer Society (2011)","DOI":"10.1109\/INFCOM.2011.5935045"},{"issue":"3","key":"10_CR33","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TKDE.2011.254","volume":"25","author":"M Papagelis","year":"2013","unstructured":"Papagelis, M., Das, G., Koudas, N.: Sampling online social networks. IEEE Trans. Knowled. Data Eng. 25(3), 662\u2013676 (2013)","journal-title":"IEEE Trans. Knowled. Data Eng."},{"key":"10_CR34","unstructured":"Pinheiro, C.A.R.: Social network analysis in telecommunications, vol.\u00a037. Wiley (2011)"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036,106 (2007)","DOI":"10.1103\/PhysRevE.76.036106"},{"issue":"1","key":"10_CR36","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoret. Comput. Sci. 158(1), 233\u2013277 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR37","unstructured":"Sarmento, R., Cordeiro, M., Gama, J.: Visualization for streaming networks. In: Proceedings of the 3rd Workshop on New Frontiers in Mining Complex Patterns (NFMCP 2014), pp. 62\u201374 (2014)"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Sarmento, R., Cordeiro, M., Gama, J.: Streaming networks sampling using top-k networks. In: Proceedings of the 17th International Conference on Enterprise Information Systems (ICEIS 2015), p. to appear. INSTICC (2015)","DOI":"10.5220\/0005341402280234"},{"key":"10_CR39","unstructured":"Shang, J., Liu, L., Xie, F., Chen, Z., Miao, J., Fang, X., Wu, C.: A real-time detecting algorithm for tracking community structure of dynamic networks. In: Proceedings of the 6th SNA-KDD Workshop (SNA-KDD 2012), pp. 1\u20139. ACM (2012)"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Xie, J., Chen, M., Szymanski, B.K.: Labelrankt: Incremental community detection in dynamic networks via label propagation. In: Proceedings of the Workshop on Dynamic Networks Management and Mining (DyNetMM 2013), pp. 25\u201332. ACM (2013)","DOI":"10.1145\/2489247.2489249"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Xie, J., Szymanski, B.K.: Community detection using a neighborhood strength driven label propagation algorithm. In: Proceedings of the IEEE Network Science Workshop (NSW 2011), pp. 188\u2013195. IEEE Computer Society (2011)","DOI":"10.1109\/NSW.2011.6004645"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-30220-6_3","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J Xie","year":"2012","unstructured":"Xie, J., Szymanski, B.K.: Towards linear time overlapping community detection in social networks. In: Tan, P.N., Chawla, S., Ho, C., Bailey, J. (eds.) Advances in Knowledge Discovery and Data Mining. Lecture Notes in Computer Science, vol. 7302, pp. 25\u201336. Springer, Berlin (2012)"},{"key":"10_CR43","unstructured":"Yun, S.Y., Lelarge, M., Proutiere, A.: Streaming, memory limited algorithms for community detection. In: Advances in Neural Information Processing Systems (NIPS 2014), pp. 3167\u20133175 (2014)"}],"container-title":["Studies in Big Data","Big Data Analysis: New Algorithms for a New Society"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26989-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:56:05Z","timestamp":1559332565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26989-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,17]]},"ISBN":["9783319269870","9783319269894"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26989-4_10","relation":{},"ISSN":["2197-6503","2197-6511"],"issn-type":[{"type":"print","value":"2197-6503"},{"type":"electronic","value":"2197-6511"}],"subject":[],"published":{"date-parts":[[2015,12,17]]}}}