{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:37:34Z","timestamp":1760783854936},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T00:00:00Z","timestamp":1409270400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s11432-014-5156-y","type":"journal-article","created":{"date-parts":[[2014,8,28]],"date-time":"2014-08-28T13:30:46Z","timestamp":1409232646000},"page":"1-17","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Perturbation analysis for the normalized Laplacian matrices in the multiway spectral clustering method"],"prefix":"10.1007","volume":"57","author":[{"given":"SuMuYa","family":"Borjigin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ChongHui","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,29]]},"reference":[{"key":"5156_CR1","first-page":"873","volume-title":"Advances in Neural Information Processing Systems","author":"M Meil\u0103","year":"2001","unstructured":"Meil\u0103 M, Shi J B. Learning segmentation by random walks. In: Advances in Neural Information Processing Systems. Cambridge: MIT Press, 2001. 873\u2013879"},{"key":"5156_CR2","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J B Shi","year":"2000","unstructured":"Shi J B, Malik J. Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell, 2000, 22: 888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5156_CR3","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z Y Wu","year":"1993","unstructured":"Wu Z Y, Leahy R. A optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans Pattern Anal Mach Intell, 1993, 15: 1101\u20131113","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5156_CR4","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L Hagen","year":"1992","unstructured":"Hagen L, Kahng A. New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput Aided Des, 1992, 11: 1074\u20131085","journal-title":"IEEE Trans Comput Aided Des"},{"key":"5156_CR5","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/34.857006","volume":"22","author":"S Sarkar","year":"2000","unstructured":"Sarkar S, Soundararajan P. Supervised learning of large perceptual organization: graph spectral partitioning and learning automata. IEEE Trans Pattern Anal Mach Intell, 2000, 22: 504\u2013525","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5156_CR6","series-title":"Pennsylvania State University Technical Report","volume-title":"Spectral Relaxation Models and Structure Analysis for K-way Graph Clustering and Bi-clustering","author":"M Gu","year":"2001","unstructured":"Gu M, Zha H Y, Ding C, et al. Spectral Relaxation Models and Structure Analysis for K-way Graph Clustering and Bi-clustering. Pennsylvania State University Technical Report. 2001"},{"key":"5156_CR7","volume-title":"University of Washington Technical Report","author":"M Meil\u0103","year":"2003","unstructured":"Meil\u0103 M, Xu L. Multiway Cuts and Spectral Clustering. University of Washington Technical Report. 2003"},{"key":"5156_CR8","first-page":"849","volume-title":"Advances in Neural Information Processing Systems","author":"A Ng","year":"2002","unstructured":"Ng A, Jordan M, Weiss Y. On spectral clustering: analysis and an Algorithm. In: Advances in Neural Information Processing Systems. Cambridge: MIT Press, 2002. 849\u2013856"},{"key":"5156_CR9","volume-title":"University of Washington Technical Report","author":"D Verma","year":"2003","unstructured":"Verma D, Meil\u0103 M. A Comparison of Spectral Clustering Algorithms. University of Washington Technical Report. 2003"},{"key":"5156_CR10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg","year":"2007","unstructured":"Luxburg U. A tutorial on spectral clustering. Stat Comput, 2007, 17: 395\u2013416","journal-title":"Stat Comput"},{"key":"5156_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11432-007-0007-8","volume":"50","author":"Z Tian","year":"2007","unstructured":"Tian Z, Li X, Ju Y. Spectral clustering based on matrix perturbation theory. Sci China Ser-F: Inf Sci, 2007, 50: 63\u201381","journal-title":"Sci China Ser-F: Inf Sci"},{"key":"5156_CR12","first-page":"705","volume-title":"Advances in Neural Information Processing Systems","author":"L Huang","year":"2009","unstructured":"Huang L, Yan D H, Jordan M, et al. Spectral clustering with perturbed data. In: Advances in Neural Information Processing Systems. New York: Curran Associates, 2009. 705\u2013712"},{"key":"5156_CR13","doi-asserted-by":"crossref","first-page":"1878","DOI":"10.1214\/11-AOS887","volume":"39","author":"K Rohe","year":"2011","unstructured":"Rohe K, Chatterjee S, Yu B. Spectral clustering and the high-dimensional stochastic block model. Ann Stat, 2011, 39: 1878\u20131915","journal-title":"Ann Stat"},{"key":"5156_CR14","first-page":"954","volume-title":"Advances in Neural Information Processing Systems","author":"S Balakrishnan","year":"2011","unstructured":"Balakrishnan S, Xu M, Krishnamurthy A, et al. Noise thresholds for spectral clustering. In: Advances in Neural Information Processing Systems. New York: Curran Associates, 2011. 954\u2013962"},{"key":"5156_CR15","first-page":"189","volume-title":"Matrix Perturbation Theory","author":"W Stewart","year":"1990","unstructured":"Stewart W, Sun J G. Matrix Perturbation Theory. Boston: Academic Press, 1990. 189\u2013283"},{"key":"5156_CR16","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"B Bhatia","year":"1997","unstructured":"Bhatia B. Matrix Analysis. New York: Springer, 1997. 212\u2013214"},{"key":"5156_CR17","first-page":"250","volume-title":"Matrix Computations","author":"G Golub","year":"1996","unstructured":"Golub G, Loan C. Matrix Computations. 3rd ed. Baltimore and London: Johns Hopkins University Press, 1996. 250\u2013253","edition":"3rd ed."}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5156-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5156-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5156-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:37:58Z","timestamp":1559389078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5156-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,29]]},"references-count":17,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["5156"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5156-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,29]]}}}