{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T22:24:40Z","timestamp":1791239080470,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642136719","type":"print"},{"value":"9783642136726","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_14","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T10:38:17Z","timestamp":1274179097000},"page":"133-146","source":"Crossref","is-referenced-by-count":11,"title":["Subgraph Mining on Directed and Weighted Graphs"],"prefix":"10.1007","author":[{"given":"Stephan","family":"G\u00fcnnemann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica\u00a029(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In: ECML\/PKDD, vol.\u00a0(2), pp. 33\u201349 (2008)","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: KDD, pp. 150\u2013160 (2000)","DOI":"10.1145\/347090.347121"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Long, B., Wu, X., Zhang, Z.M., Yu, P.S.: Unsupervised learning on k-partite graphs. In: KDD, pp. 317\u2013326 (2006)","DOI":"10.1145\/1150402.1150439"},{"key":"14_CR6","unstructured":"Wu, F., Huberman, B.A.: Finding communities in linear time: A physics approach. CoRR cond-mat\/0310600 (2003)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Ruan, J., Zhang, W.: An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: ICDM, pp. 643\u2013648 (2007)","DOI":"10.1109\/ICDM.2007.72"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Long, B., Zhang, Z.M., Yu, P.S.: A probabilistic framework for relational clustering. In: KDD, pp. 470\u2013479 (2007)","DOI":"10.1145\/1281192.1281244"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: KDD, pp. 824\u2013833 (2007)","DOI":"10.1145\/1281192.1281280"},{"issue":"8","key":"14_CR10","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE TPAMI\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE TPAMI"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Meila, M., Pentney, W.: Clustering by weighted cuts in directed graphs. In: SDM (2007)","DOI":"10.1137\/1.9781611972771.13"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: ICDM, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"8271","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA\u00a099, 8271\u20138276 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"14_CR14","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":"14_CR15","doi-asserted-by":"crossref","unstructured":"Gregory, S.: A fast algorithm to find overlapping communities in networks. In: ECML\/PKDD, vol.\u00a0(1), pp. 408\u2013423 (2008)","DOI":"10.1007\/978-3-540-87479-9_45"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"66111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E\u00a070, 66111 (2004)","journal-title":"Phys. Rev. E"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. PNAS USA\u00a0103, 8577\u20138582 (2006)","journal-title":"PNAS USA"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Chen, J., Za\u00efane, O.R., Goebel, R.: Detecting communities in social networks using max-min modularity. In: SDM, pp. 978\u2013989 (2009)","DOI":"10.1137\/1.9781611972795.84"},{"key":"14_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3324-9","volume-title":"Density Estimation for Statistics and Data Analysis","author":"B.W. Silverman","year":"1986","unstructured":"Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Chapman and Hall, London (1986)"},{"key":"14_CR20","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases. In: KDD, pp. 226\u2013231 (1996)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H.P., Kr\u00f6ger, P.: Density-connected subspace clustering for high-dimensional data. In: SDM, pp. 246\u2013257 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"key":"14_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C. Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, Heidelberg (2001)"},{"issue":"1","key":"14_CR23","first-page":"1270","volume":"2","author":"E. M\u00fcller","year":"2009","unstructured":"M\u00fcller, E., G\u00fcnnemann, S., Assent, I., Seidl, T.: Evaluating clustering in subspace projections of high dimensional data. PVLDB\u00a02(1), 1270\u20131281 (2009)","journal-title":"PVLDB"},{"key":"14_CR24","volume-title":"Information Retrieval","author":"C.J. Rijsbergen Van","year":"1979","unstructured":"Van Rijsbergen, C.J.: Information Retrieval. Butterworths, London (1979)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:10:18Z","timestamp":1619770218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}