{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T19:55:55Z","timestamp":1791143755766,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387081","type":"print"},{"value":"9783642387098","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40991-2_3","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T01:43:57Z","timestamp":1377654237000},"page":"32-47","source":"Crossref","is-referenced-by-count":8,"title":["Discovering Nested Communities"],"prefix":"10.1007","author":[{"given":"Nikolaj","family":"Tatti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, G., Kempe, D.: Modularity-maximizing network communities via mathematical programming. European Physics Journal B\u00a066(3) (2008)","DOI":"10.1140\/epjb\/e2008-00425-1"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ayer, M., Brunk, H., Ewing, G., Reid, W.: An empirical distribution function for sampling with incomplete information. The Annals of Mathematical Statistics\u00a026(4) (1955)","DOI":"10.1214\/aoms\/1177728423"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bellman, R.: On the approximation of curves by line segments using dynamic programming. Communications of the ACM\u00a04(6) (1961)","DOI":"10.1145\/366573.366611"},{"key":"3_CR4","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":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society (1997)","DOI":"10.1090\/cbms\/092"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Coscia, M., Rossetti, G., Giannotti, F., Pedreschi, D.: DEMON: a local-first discovery method for overlapping communities. In: KDD (2012)","DOI":"10.1145\/2339530.2339630"},{"key":"3_CR8","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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L., Coetzee, F.M.: Self-organization and identification of web communities. Computer 35(3) (2002)","DOI":"10.1109\/2.989932"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports, 486 (2010)","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS 99 (2002)","DOI":"10.1073\/pnas.122653799"},{"key":"3_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-74976-9_12","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"S. Gregory","year":"2007","unstructured":"Gregory, S.: An algorithm to find overlapping community structure in networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol.\u00a04702, pp. 91\u2013102. Springer, Heidelberg (2007)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Guha, S., Koudas, N., Shim, K.: Approximation and streaming algorithms for histogram construction problems. ACM TODS 31 (2006)","DOI":"10.1145\/1132863.1132873"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Haiminen, N., Gionis, A.: Unimodal segmentation of sequences. In: ICDM (2004)","DOI":"10.1109\/ICDM.2004.10109"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel algorithms for multi-constraint graph partitioning. In: CDROM (1998)","DOI":"10.1109\/SC.1998.10018"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity graphs in networks. TKDD\u00a01(3) (2007)","DOI":"10.1145\/1297332.1297336"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: WWW (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"3_CR18","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS (2001)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435 (2005)","DOI":"10.1038\/nature03607"},{"key":"3_CR20","unstructured":"Pinney, J., Westhead, D.: Betweenness-based decomposition methods for social and biological networks. In: Interdisciplinary Statistics and Bioinformatics (2006)"},{"key":"3_CR21","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":"3_CR22","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD (2006)","DOI":"10.1145\/1150402.1150448"},{"key":"3_CR24","unstructured":"van Dongen, S.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing\u00a017(4) (2007)","DOI":"10.1007\/s11222-007-9033-z"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A spectral clustering approach to finding communities in graph. In: SDM (2005)","DOI":"10.1137\/1.9781611972757.25"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, S., Wang, R.-S., Zhang, X.-S.: Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Physica A (2007)","DOI":"10.1016\/j.physa.2006.07.023"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1007\/978-3-540-24688-6_137","volume-title":"Computational Science - ICCS 2004","author":"H. Zhou","year":"2004","unstructured":"Zhou, H., Lipowsky, R.: Network brownian motion: A new method to measure vertex-vertex proximity and to identify communities and subcommunities. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol.\u00a03038, pp. 1062\u20131069. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40991-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T02:16:27Z","timestamp":1563761787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40991-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40991-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}