{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:57:04Z","timestamp":1725541024283},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642104381"},{"type":"electronic","value":"9783642104398"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10439-8_34","type":"book-chapter","created":{"date-parts":[[2009,11,16]],"date-time":"2009-11-16T11:03:31Z","timestamp":1258369411000},"page":"330-339","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Distance Based Structural Clustering Approach for Networks"],"prefix":"10.1007","author":[{"given":"Xin","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"34_CR2","doi-asserted-by":"crossref","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. Mathematical Sociology\u00a025, 163\u2013177 (2001)","journal-title":"J. Mathematical Sociology"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. In: Proc. of ICDM 2001, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"34_CR4","first-page":"226","volume-title":"Proc. of 3rd KDD","author":"M. Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. of 3rd KDD, pp. 226\u2013231. AAAI Press, Menlo Park (1996)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97 (SHORTEST PATH). Communications of the ACM\u00a05, 345 (1962)","journal-title":"Communications of the ACM"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman, L.C.: A Set of Measures of Centrality based upon Betweeness. Sociometry\u00a040, 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"7821","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. PNAS\u00a099, 7821\u20137826 (2002)","journal-title":"PNAS"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1038\/nature03288","volume":"433","author":"R. Guimera","year":"2005","unstructured":"Guimera, R., Amaral, L.A.N.: Functional Cartography of Complex Metabolic Networks. Nature\u00a0433, 895\u2013900 (2005)","journal-title":"Nature"},{"key":"34_CR9","unstructured":"Hinneburg, A., Keim, D.A.: An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In: Proc. KDD 1998, pp. 58\u201365 (1998)"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L. Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing Partitions. J. Classification.\u00a02, 193\u2013218 (1985)","journal-title":"J. Classification."},{"key":"34_CR11","first-page":"336","volume-title":"Proc. of SIGKDD 2008","author":"W. Hwang","year":"2008","unstructured":"Hwang, W., Kim, T., Ramanathan, M., Zhang, A.: Bridging Centrality: Graph Mining from Element Level to Group Level. In: Proc. of SIGKDD 2008, pp. 336\u2013344. ACM Press, New York (2008)"},{"key":"34_CR12","first-page":"177","volume-title":"Proc. of 11th ACM SIGKDD","author":"J. Leskovec","year":"2005","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In: Proc. of 11th ACM SIGKDD, pp. 177\u2013187. ACM Press, New York (2005)"},{"key":"34_CR13","unstructured":"Network data, \n                    \n                      http:\/\/www-personal.umich.edu\/~mejn\/netdata"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Phys. Rev. E\u00a069, 26113 (2004)","journal-title":"Phys. Rev. E"},{"key":"34_CR15","unstructured":"Social Network Analysis Software and Services for Organizations, Communities, and their Consultants, \n                    \n                      http:\/\/www.orgnet.com"},{"key":"34_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis. Cambridge Univ. Press, Cambridge (1994)"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective Dynamics of \u2018Small World\u2019 Networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"34_CR18","first-page":"824","volume-title":"Proc. of SIGKDD 2007","author":"X. Xu","year":"2007","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: a Structural Clustering Algorithm for Networks. In: Proc. of SIGKDD 2007, pp. 824\u2013833. ACM Press, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","AI 2009: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10439-8_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:31:24Z","timestamp":1619782284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10439-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642104381","9783642104398"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10439-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}