{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:27:32Z","timestamp":1759073252101},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430025"},{"type":"electronic","value":"9783540452942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_3","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:45:12Z","timestamp":1181616312000},"page":"18-41","source":"Crossref","is-referenced-by-count":44,"title":["On Clustering Using Random Walks"],"prefix":"10.1007","author":[{"given":"David","family":"Harel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Koren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"3_CR1","unstructured":"V. Estivill-Castro and I. Lee,\u201cAUTOCLUST: Automatic Clustering via Boundary Extraction for Mining Massive Point-Data Sets\u201d, 5th International Conference on Geocomputation, GeoComputation CD-ROM: GC049, ISBN 0-9533477-2-9."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Y. Gdalyahu, D. Weinshall and M. Werman, \u201cStochastic Image Segmentation by Typical Cuts\u201d, Proceedings IEEE Conference on Computer Vision and Pattern Recognition, 1999, pp. 588\u2013601.","DOI":"10.1109\/CVPR.1999.784979"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"S. Guha, R. Rastogi and K. Shim, \u201cROCK: A Robust Clustering Algorithm for Categorical Attributes\u201d, Proceedings of the 15th International Conference on Data Engineering, pp. 512\u2013521, 1999.","DOI":"10.1109\/ICDE.1999.754967"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"L. Hagen and A. Kahng, \u201cA New Approach to Effective Circuit Clustering\u201d, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 422\u2013427, 1992.","DOI":"10.1109\/ICCAD.1992.279334"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"D. Harel and Y. Koren, \u201cClustering Spatial Data using Random Walks\u201d, Proc.7th ACM SIGKDD Int.Conf.on Knowledge Discovery and Data Mining (KDD-2001), ACM, pp. 281\u2013286, 2000.","DOI":"10.1145\/502512.502552"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"D. Harel and Y. Koren, \u201cClustering Spatial Data Using Random Walks\u201d, Technical Report MCS01-08, Dept. of Computer Science and Applied Mathematics, The Weizmann Institute of Science, 2001. Available at: http:\/\/www.wisdom.weizmann.ac.il\/reports.html","DOI":"10.1145\/502512.502552"},{"key":"3_CR7","volume-title":"Algorithms for Clustering Data","author":"A. K. Jain","year":"1988","unstructured":"A. K. Jain and R. C. Dubes, Algorithms for Clustering Data, Prentice Hall, Englewood Cliffs, New Jersy, 1988."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A. K. Jain","year":"1999","unstructured":"A. K. Jain, M.N. Murty and P.J. Flynn, \u201cData Clustering: A Review\u201d, ACM Computing Surveys, 31 (1999), 264\u2013323.","journal-title":"ACM Computing Surveys"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"G. Karypis, E. Han, and V. Kumar, \u201cCHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling\u201d, IEEE Computer, 32 (1999), 68\u201375.","journal-title":"IEEE Computer"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"G. Karypis and V. Kumar, \u201cA Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs\u201d, SIAM Journal on Scientific Computing 20:1 (1999), 359\u2013392.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"E. Sharon, A. Brandt and R. Basri, \u201cFast Multiscale Image Segmentation\u201d, Proceedings IEEE Conference on Computer Vision and Pattern Recognition, pp. 70\u201377, 2000.","DOI":"10.1109\/CVPR.2000.855801"},{"key":"3_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-46784-X_13","volume-title":"On the Nature of Structure and its Identification","author":"B. Stein","year":"1999","unstructured":"B. Stein and O. Niggemann, \u201cOn the Nature of Structure and its Identification\u201d, Proceedings 25th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 1665, pp. 122\u2013134, Springer Verlag, 1999."},{"key":"3_CR13","unstructured":"N. Tishby and N. Slonim, \u201cData Clustering by Markovian relaxation and the Information Bottleneck Method\u201d, Advances in Neural Information Processing Systems 13, 2000."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:41:23Z","timestamp":1683888083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}