{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:17:29Z","timestamp":1771697849251,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,2,1]],"date-time":"2007-02-01T00:00:00Z","timestamp":1170288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SCI CHINA SER F"],"published-print":{"date-parts":[[2007,2]]},"DOI":"10.1007\/s11432-007-0007-8","type":"journal-article","created":{"date-parts":[[2007,6,27]],"date-time":"2007-06-27T16:41:05Z","timestamp":1182962465000},"page":"63-81","source":"Crossref","is-referenced-by-count":23,"title":["Spectral clustering based on matrix perturbation theory"],"prefix":"10.1007","volume":"50","author":[{"given":"Zheng","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiaoBin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YanWei","family":"Ju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Bach R, Jordan M I. Learning spectral clustering. University of California at Berkeley Technical report UCB\/CSD-03-1249. 2003"},{"key":"7_CR2","unstructured":"Xing E P, Jordan M I. On semidefinite relaxation for normalized k-cut and connections to spectral clustering. University of California at Berkeley Technical report UCB\/CSD-3-1265. 2003"},{"issue":"5","key":"7_CR3","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W. E. Donath","year":"1973","unstructured":"Donath W E, Hoffman A J. Lower bounds for partitioning of graphs. IBM J Res Devel, 1973, 17(5): 420\u2013425","journal-title":"IBM J Res Devel"},{"issue":"100","key":"7_CR4","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"Fiedler M. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Mathemat J, 1975, 25(100): 619\u2013633","journal-title":"Czechoslovak Mathemat J"},{"issue":"9","key":"7_CR5","doi-asserted-by":"crossref","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 Comput-Aid Design, 1992, 11(9): 1074\u20131085","journal-title":"IEEE Trans Comput-Aid Design"},{"issue":"9","key":"7_CR6","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/43.310898","volume":"13","author":"P. K. Chan","year":"1994","unstructured":"Chan P K, Schlag M D F, Zien J Y. Spectral k-way ratio-cut partitioning and clustering. IEEE Trans Comput-Aid Design Integ Circ Syst, 1994, 13(9): 1088\u20131096","journal-title":"IEEE Trans Comput-Aid Design Integ Circ Syst"},{"issue":"8","key":"7_CR7","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 Trans Patt Anal Mach Intel, 2000, 22(8): 888\u2013905","journal-title":"IEEE Trans Patt Anal Mach Intel"},{"issue":"2","key":"7_CR8","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/TPAMI.2004.1262185","volume":"26","author":"C. Fowlkes","year":"2004","unstructured":"Fowlkes C, Belongie S, Chung F, et al. Spectral grouping using the Nystr\u00f6m method. IEEE Trans Patt Anal Mach Intel, 2004, 26(2): 214\u2013225","journal-title":"IEEE Trans Patt Anal Mach Intel"},{"key":"7_CR9","first-page":"107","volume-title":"ICDM 2001","author":"C. H. Q. Ding","year":"2001","unstructured":"Ding C H Q, He X, Zha H, et al. A min-max cut algorithm for graph partitioning and data clustering. In: Cercone N, Lin T Y, Wu X, eds. ICDM 2001. Los Alamitos, California: IEEE Computer Society, 2001. 107\u2013114"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1145\/502512.502551","volume-title":"Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"C. H. Q. Ding","year":"2001","unstructured":"Ding C H Q, He X, Zha H. A spectral method to separate disconnected and nearly-disconnected web graph components. In: Provost F, Srikant R, eds. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: Association for Computing Machinery, 2001. 275\u2013280."},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1109\/ICCV.1999.790354","volume-title":"Computer Vision, 1999, the proceedings of the Seventh IEEE International Conference on","author":"Y. Weiss","year":"1999","unstructured":"Weiss Y. Segmentation using eigenvectors: a unifying view. In: Computer Vision, 1999, the proceedings of the Seventh IEEE International Conference on. Los Alamitos, California: IEEE Computer Society, 1999. 975\u2013982"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Dhillon I S, Guan Y, Kulis B. A unified view of kernel k-means, spectral clustering and graph cuts. University of Texas at Austin UTCS Technical Report TR-04-25. 2004","DOI":"10.1145\/1014052.1014118"},{"issue":"3","key":"7_CR13","doi-asserted-by":"crossref","first-page":"597","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, 2004, 51(3): 597\u2013515","journal-title":"J ACM"},{"key":"7_CR14","first-page":"849","volume-title":"Advances in Neural Information Processing Systems 14","author":"A. Y. Ng","year":"2002","unstructured":"Ng A Y, Jordan M I, Weiss Y. On spectral clustering: Analysis and an algorithm. In: Dietterich T G, Becker S, Ghahramani Z, eds. Advances in Neural Information Processing Systems 14. Cambridge, MA: MIT Press, 2002. 849\u2013856"},{"key":"7_CR15","unstructured":"Brand M, Huang K. A unifying theorem for spectral embedding and clustering. Mitsubishi Electric Research Laboratory Technical Report TR2002-42. 2002."},{"key":"7_CR16","first-page":"252","volume-title":"Matrix Perturbation Analysis (in Chinese)","author":"J. Sun","year":"2001","unstructured":"Sun J. Matrix Perturbation Analysis (in Chinese). 2nd ed. Beijing: Science Press, 2001. 252\u2013272","edition":"2nd ed."},{"key":"7_CR17","volume-title":"The UCI KDD Archive","author":"S. Hettich","year":"1999","unstructured":"Hettich S, Bay S D. The UCI KDD Archive [ http:\/\/kdd.ics.uci.edu ]. Irvine, CA: University of California, Department of Information and Computer Science, 1999"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-007-0007-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-007-0007-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-007-0007-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T04:38:24Z","timestamp":1629088704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-007-0007-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s11432-007-0007-8","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2]]}}}