{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:26:10Z","timestamp":1725549970372},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289692"},{"type":"electronic","value":"9783540320111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11556121_17","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:47:51Z","timestamp":1127832471000},"page":"128-136","source":"Crossref","is-referenced-by-count":1,"title":["Commute Times for Graph Spectral Clustering"],"prefix":"10.1007","author":[{"given":"Huaijun","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-7","key":"17_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems\u00a030(1-7), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral Graph Theory. CBMS series, vol.\u00a092. American Mathmatical Society, Providence (1997)","DOI":"10.1090\/cbms\/092"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K., Yau, S.-T.: Discrete green\u2019s functions. J. Combin. Theory Ser., 191\u2013214 (2000)","DOI":"10.1006\/jcta.2000.3094"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Gori, M., Maggini, M., Sarti, L.: Graph matching using random walks. In: ICPR 2004, pp. III, 394\u2013397 (2004)","DOI":"10.1109\/ICPR.2004.1334549"},{"key":"17_CR5","unstructured":"Kondor, R., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: 19th Intl. Conf. on Machine Learning (ICML) [ICM 2002] (2002)"},{"key":"17_CR6","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey"},{"key":"17_CR7","unstructured":"Meila, M., Shi, J.: A random walks view of spectral segmentation (2001)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Pavan, M., Pelillo, M.: A new graph-theoretic approach to clustering and segmentation. In: CVPR 2003, pp. I, 145\u2013152 (2003)","DOI":"10.1109\/CVPR.2003.1211348"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Robles-Kelly, A., Hancock, E.R.: String edit distance, random walks and graph matching. In: PAMI (2005) (to appear)","DOI":"10.1142\/S0218001404003277"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Saerens, M., Fouss, F., Yen, L., Dupont, P.: The principal components analysis of a graph, and its relationships to spectral clustering. In: LN-AI (2004)","DOI":"10.1007\/978-3-540-30115-8_35"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Sarkar, S., Boyer, K.L.: Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. In: CVPR, p. 478 (1996)","DOI":"10.1109\/CVPR.1996.517115"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Scott, G., Longuet-Higgins, H.: Feature grouping by relicalisation of eigenvectors of the proximity matrix. In: BMVC., pp. 103\u2013108 (1990)","DOI":"10.5244\/C.4.20"},{"issue":"8","key":"17_CR13","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 PAMI\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE PAMI"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Sood, V., Redner, S., ben Avraham, D.: First-passage properties of the erdoscrenyi random graph. J. Phys. A: Math. Gen., 109\u2013123 (2005)","DOI":"10.1088\/0305-4470\/38\/1\/007"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11556121_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:47:16Z","timestamp":1605642436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11556121_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289692","9783540320111"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11556121_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}