{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T15:15:55Z","timestamp":1778080555402,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725831","type":"print"},{"value":"9783540725848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72584-8_66","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:58:59Z","timestamp":1184594339000},"page":"497-504","source":"Crossref","is-referenced-by-count":3,"title":["A Graph Clustering Algorithm Based on Minimum and Normalized Cut"],"prefix":"10.1007","author":[{"given":"Jiabing","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingsong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuangxin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys\u00a031, 264\u2013323 (1999)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"66_CR2","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R. Xu","year":"2005","unstructured":"Xu, R., Wunsch II, D.: Survey of Clustering Algorithms. IEEE Trans. on Neural Networks\u00a016(3), 645\u2013678 (2005)","journal-title":"IEEE Trans. on Neural Networks"},{"issue":"3","key":"66_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R. Kannan","year":"2004","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On Clusterings: Good, Bad and Spectral. J. ACM\u00a051(3), 497\u2013515 (2004)","journal-title":"J. ACM"},{"issue":"8","key":"66_CR4","doi-asserted-by":"publisher","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 Trans. on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"66_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patcog.2005.06.014","volume":"39","author":"H. Qiu","year":"2006","unstructured":"Qiu, H., Hancock, E.R.: Graph Matching and Clustering Using Spectral Partitions. Pattern Recognition\u00a039, 22\u201334 (2006)","journal-title":"Pattern Recognition"},{"key":"66_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.csda.2004.04.010","volume":"49","author":"D. Tritchler","year":"2005","unstructured":"Tritchler, D., Fallah, S., Beyene, J.: A Spectral Clustering Method for Microarray Data. Computational Statistics & Data Analysis\u00a049, 63\u201376 (2005)","journal-title":"Computational Statistics & Data Analysis"},{"issue":"3","key":"66_CR7","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1109\/TNN.2006.872358","volume":"17","author":"S. Vaerenbergh Van","year":"2006","unstructured":"Van Vaerenbergh, S., Santamar\u00eda, I.: A Spectral Clustering Approach to Underdetermined Postnonlinear Blind Source Separation of Sparse Sources. IEEE Trans. on Neural Networks\u00a017(3), 811\u2013814 (2006)","journal-title":"IEEE Trans. on Neural Networks"},{"issue":"11","key":"66_CR8","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z. Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.: An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a015(11), 1101\u20131113 (1993)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"66_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","volume":"76","author":"E. Hartuv","year":"2000","unstructured":"Hartuv, E., Shamir, R.: A Clustering Algorithm Based on Graph Connectivity. Information Processing Letters\u00a076, 175\u2013181 (2000)","journal-title":"Information Processing Letters"},{"issue":"9","key":"66_CR10","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L. Hagen","year":"1992","unstructured":"Hagen, L., Kahng, A.B.: New Spectral Methods for Ratio Cut Partitioning and Clustering. IEEE Trans. on Computer-Aided Design\u00a011(9), 1074\u20131085 (1992)","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"66_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/ICDM.2001.989507","volume-title":"Proceedings of IEEE 2001 International Conference on Data Mining","author":"H. Ding","year":"2001","unstructured":"Ding, H., He, X., Zha, H., et al.: A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering. In: Proceedings of IEEE 2001 International Conference on Data Mining, pp. 107\u2013114. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"6","key":"66_CR12","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/TPAMI.2003.1201817","volume":"25","author":"P. Soundararajan","year":"2003","unstructured":"Soundararajan, P., Sarkar, S.: An In-Depth Study of Graph Partitioning Measures for Perceptual Organization. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a025(6), 642\u2013660 (2003)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"66_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/TMI.2003.819929","volume":"23","author":"J. Carballido-Gamio","year":"2004","unstructured":"Carballido-Gamio, J., Belongie, S., Majumdar, J.S.: Normalized Cuts in 3-D for Spinal MRI Segmentation. IEEE Trans. on Medical Imaging\u00a023(1), 36\u201344 (2004)","journal-title":"IEEE Trans. on Medical Imaging"},{"key":"66_CR14","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1016\/j.patrec.2005.07.022","volume":"27","author":"A. Duarte","year":"2006","unstructured":"Duarte, A., S\u00e1nchez, \u00c1., Fern\u00e1ndez, F., et al.: Improving Image Segmentation Quality through Effective Region Merging Using a Hierarchical Social Metaheuristic. Pattern Recognition Letters\u00a027, 1239\u20131251 (2006)","journal-title":"Pattern Recognition Letters"},{"key":"66_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0167-9473(02)00070-1","volume":"41","author":"X. He","year":"2002","unstructured":"He, X., Zha, H., Ding, C.H.Q., et al.: Web Document Clustering Using Hyperlink Structures. Computational Statistics & Data Analysis\u00a041, 19\u201345 (2002)","journal-title":"Computational Statistics & Data Analysis"},{"issue":"3","key":"66_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TVCG.2006.54","volume":"12","author":"H. Li","year":"2006","unstructured":"Li, H., Chen, W., Shen, I.-F.: Segmentation of Discrete Vector Fields. IEEE Trans. on Visualization and Computer Graphics\u00a012(3), 289\u2013300 (2006)","journal-title":"IEEE Trans. on Visualization and Computer Graphics"},{"issue":"2","key":"66_CR17","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/TCSVT.2004.841694","volume":"15","author":"C. Ngo","year":"2005","unstructured":"Ngo, C., Ma, Y., Zhang, H.: Video Summarization and Scene Detection by Graph Modeling. IEEE Trans. on Circuits and Systems for Video Technology\u00a015(2), 296\u2013305 (2005)","journal-title":"IEEE Trans. on Circuits and Systems for Video Technology"},{"issue":"2","key":"66_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TPAMI.2004.1262179","volume":"26","author":"X. Yu Stella","year":"2004","unstructured":"Yu Stella, X., Shi, J.: Segmentation Given Partial Grouping Constraints. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a026(2), 173\u2013183 (2004)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"66_CR19","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Discrete Mathematics\u00a05, 54\u201366 (1992)","journal-title":"SIAM J. Discrete Mathematics"},{"issue":"4","key":"66_CR20","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A Simple Min-Cut Algorithm. J. ACM\u00a044(4), 585\u2013591 (1997)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72584-8_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:58:30Z","timestamp":1550437110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72584-8_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725831","9783540725848"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72584-8_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}