{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:36Z","timestamp":1742913216477,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448502"},{"type":"electronic","value":"9783662448519"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44851-9_43","type":"book-chapter","created":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T09:00:58Z","timestamp":1409562058000},"page":"678-693","source":"Crossref","is-referenced-by-count":18,"title":["Discovering Dynamic Communities in Interaction Networks"],"prefix":"10.1007","author":[{"given":"Polina","family":"Rozenshtein","sequence":"first","affiliation":[]},{"given":"Nikolaj","family":"Tatti","sequence":"additional","affiliation":[]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Akoglu, L., Faloutsos, C.: Event detection in time series of mobile communication graphs. In: Army Science Conference (2010)"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. Journal of Algorithms\u00a034(2) (2000)","DOI":"10.1006\/jagm.1999.1062"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Asur, S., Parthasarathy, S., Ucar, D.: An event-based framework for characterizing the evolutionary behavior of interaction graphs. TKDD \u00a03(4) (2009)","DOI":"10.1145\/1631162.1631164"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Huttenlocher, D.P., Kleinberg, J.M., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: KDD (2006)","DOI":"10.1145\/1150402.1150412"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-04180-8_25","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M. Berlingerio","year":"2009","unstructured":"Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining graph evolution rules. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part I. LNCS, vol.\u00a05781, pp. 115\u2013130. Springer, Heidelberg (2009)"},{"issue":"3","key":"43_CR6","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/s10618-013-0331-0","volume":"27","author":"M. Berlingerio","year":"2013","unstructured":"Berlingerio, M., Pinelli, F., Calabrese, F.: Abacus: frequent pattern mining-based community discovery in multidimensional networks. Data Mining and Knowledge Discovery\u00a027(3), 294\u2013320 (2013)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Bogdanov, P., Mongiov\u00ec, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: ICDM (2011)","DOI":"10.1109\/ICDM.2011.101"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 84\u201395. Springer, Heidelberg (2000)"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: KDD (2000)","DOI":"10.1145\/347090.347121"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports\u00a0486 (2010)","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Analysis and Applications\u00a013(1) (2010)","DOI":"10.1007\/s10044-008-0141-y"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS\u00a099 (2002)","DOI":"10.1073\/pnas.122653799"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Gleich, D.F., Seshadhri, C.: Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: KDD (2012)","DOI":"10.1145\/2339530.2339628"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Greene, D., Doyle, D., Cunningham, P.: Tracking the evolution of communities in dynamic social networks. In: ASONAM (2010)","DOI":"10.1109\/ASONAM.2010.17"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.J.: Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics (2005)","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Ide, T., Kashima, H.: Eigenspace-based anomaly detection in computer systems. In: KDD (2004)","DOI":"10.1145\/1014052.1014102"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Information Processing Letters\u00a070(1) (1999)","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: SODA (2009)","DOI":"10.1137\/1.9781611973068.60"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: KDD (2006)","DOI":"10.1145\/1150402.1150476"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kumar, R., Tomkins, A.: Microscopic evolution of social networks. In: KDD (2008)","DOI":"10.1145\/1401890.1401948"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Mahoney, M.W.: Empirical comparison of algorithms for network community detection. In: WWW (2010)","DOI":"10.1145\/1772690.1772755"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Lin, Y., Chi, Y., Zhu, S., Sundaram, H., Tseng, B.: Facetnet: A framework for analyzing communities and their evolutions in dynamic networks. In: WWW (2008)","DOI":"10.1145\/1367497.1367590"},{"issue":"5980","key":"43_CR23","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"P.J. Mucha","year":"2010","unstructured":"Mucha, P.J., Richardson, T., Macon, K., Porter, M.A., Onnela, J.-P.: Community structure in time-dependent, multiscale, and multiplex networks. Science\u00a0328(5980), 876\u2013878 (2010)","journal-title":"Science"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Palla, G., Barab\u00e1si, A., Vicsek, T.: Quantifying social group evolution. Nature\u00a0446 (2007)","DOI":"10.1038\/nature05670"},{"key":"43_CR25","doi-asserted-by":"crossref","unstructured":"Papadimitriou, P., Dasdan, A., Garcia-Molina, H.: Web graph similarity for anomaly detection. Journal of Internet Services and Applications\u00a01(1) (2010)","DOI":"10.1007\/s13174-010-0003-x"},{"key":"43_CR26","doi-asserted-by":"crossref","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. Journal of Graph Algorithms Applications\u00a010(2) (2006)","DOI":"10.7155\/jgaa.00124"},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"Priebe, C.E., Conroy, J.M., Marchette, D.J., Park, Y.: Scan statistics on enron graphs. Computational & Mathematical Organization Theory\u00a011(3) (2005)","DOI":"10.1007\/s10588-005-5378-z"},{"key":"43_CR28","unstructured":"Sricharan, K., Das, K.: Localizing anomalous changes in time-evolving graphs"},{"key":"43_CR29","doi-asserted-by":"crossref","unstructured":"Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: Graphscope: parameter-free mining of large time-evolving graphs. In: KDD (2007)","DOI":"10.1145\/1281192.1281266"},{"key":"43_CR30","unstructured":"van Dongen, S.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000)"},{"key":"43_CR31","unstructured":"Zhou, R., Liu, C., Yu, J.X., Liang, W., Zhang, Y.: Efficient truss maintenance in evolving networks. arXiv preprint arXiv:1402.2807 (2014)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44851-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T20:08:49Z","timestamp":1568491729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44851-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448502","9783662448519"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44851-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}