{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:58Z","timestamp":1725565438108},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222828"},{"type":"electronic","value":"9783540278191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27819-1_32","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T06:05:39Z","timestamp":1284444339000},"page":"457-471","source":"Crossref","is-referenced-by-count":21,"title":["On the Convergence of Spectral Clustering on Random Samples: The Normalized Case"],"prefix":"10.1007","author":[{"given":"Ulrike","family":"von Luxburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Bousquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Belkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Belkin, M.: Problems of Learning on Manifolds. PhD thesis, University of Chicago (2003)"},{"key":"32_CR2","unstructured":"Belkin, M., Niyogi, P.: Semi-supervised learning on Riemannian manifolds. Machine Learning (to appear), Available at http:\/\/people.cs.uchicago.edu\/char126\/relaxmisha"},{"key":"32_CR3","unstructured":"Bengio, Y. Vincent, P., Paiement, J.-F., Delalleau, O., Ouimet, M., Le Roux, N., Spectral clustering and kernel PCA are learning eigenfunctions. Technical Report TR 1239, University of Montreal (2003)"},{"key":"32_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R. Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, New York (1997)"},{"key":"32_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-4586-9","volume-title":"Spectral theory of self-adjoint operators in Hilbert space","author":"M. Birman","year":"1987","unstructured":"Birman, M., Solomjak, M.: Spectral theory of self-adjoint operators in Hilbert space. Reidel Publishing Company, Dordrecht (1987)"},{"key":"32_CR6","volume-title":"Advances in Neural Information Processing Systems 16","author":"O. Bousquet","year":"2004","unstructured":"Bousquet, O., Chapelle, O., Hein, M.: Measure based regularization. In: Thrun, S., Saul, L., Scholkopf, B. (eds.) Advances in Neural Information Processing Systems 16, MIT Press, Cambridge (2004)"},{"key":"32_CR7","volume-title":"Spectral Approximation of Linear Operators","author":"F. Chatelin","year":"1983","unstructured":"Chatelin, F.: Spectral Approximation of Linear Operators. Academic Press, New York (1983)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Chung, F.R. K.: Spectral graph theory .In: CBMS Regional Conference Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, Washington, DC, voi\u00a0.92 (1997)","DOI":"10.1090\/cbms\/092"},{"key":"32_CR9","doi-asserted-by":"publisher","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 the partitioning of graphs. IBM J. Res. Develop.\u00a017, 420\u2013425 (1973)","journal-title":"IBM J. Res. Develop."},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Math. J.\u00a023, 298\u2013305 (1973)","journal-title":"Czechoslovak Math. J."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Guattery, S., Miller, G.L.: On the quality of spectral separators. SIAM Journal of Matrix Anal. Appl.\u00a019(3) (1998)","DOI":"10.1137\/S0895479896312262"},{"issue":"9","key":"32_CR12","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. Computer-Aided Design\u00a011(9), 1074\u20131085 (1992)","journal-title":"IEEE Trans. Computer-Aided Design"},{"issue":"374","key":"32_CR13","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1080\/01621459.1981.10477658","volume":"76","author":"J. Hartigan","year":"1981","unstructured":"Hartigan, J.: Consistency of single linkage for high-density clusters. JASA\u00a076(374), 388\u2013394 (1981)","journal-title":"JASA"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. on Scientific Computing\u00a016, 452\u2013469 (1995)","journal-title":"SIAM J. on Scientific Computing"},{"key":"32_CR15","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings - good, bad and spectral. Technical report, Computer science Department, Yale University (2000)"},{"key":"32_CR16","volume-title":"Perturbation theory for linear operators","author":"T. Kato","year":"1966","unstructured":"Kato, T.: Perturbation theory for linear operators. Springer, Berlin (1966)"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Koltchinskii, V.: Asymptotics of spectral projections of some random matrices approximating integral operators. Progress in Probabilty\u00a043 (1998)","DOI":"10.1007\/978-3-0348-8829-5_11"},{"issue":"1","key":"32_CR18","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/3318636","volume":"6","author":"V. Koltchinskii","year":"2000","unstructured":"Koltchinskii, V., Gin\u00e9, E.: Random matrix approximation of spectra of integral operators. Bernoulli\u00a06(1), 113\u2013167 (2000)","journal-title":"Bernoulli"},{"key":"32_CR19","unstructured":"Meila, M., Shi, J.: A random walks view of spectral segmentation. In: 8th International Workshop on Artificial Intelligence and Statistics (2001)"},{"key":"32_CR20","volume-title":"Advances in Neural Information Processing Systems 14","author":"A. Ng","year":"2001","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Dietterich, T., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems 14, MIT Press, Cambridge (2001)"},{"key":"32_CR21","volume-title":"Proceedings of the Seventeenth International Conference on Machine Learning","author":"P. Niyogi","year":"2000","unstructured":"Niyogi, P., Karmarkar, N.K.: An approach to data reduction and clustering with theoretical guarantees. In: Langley, P. (ed.) Proceedings of the Seventeenth International Conference on Machine Learning, Morgan Kaufmann, San Francisco (2000)"},{"issue":"1","key":"32_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1214\/aos\/1176345339","volume":"9","author":"D. Pollard","year":"1981","unstructured":"Pollard, D.: Strong consistency of k-means clustering. Annals of Statistics\u00a09(1), 135\u2013140 (1981)","journal-title":"Annals of Statistics"},{"key":"32_CR23","volume-title":"Proceedings of the 13th International Conference on Algorithmic Learning Theory","author":"J. Shawe-Taylor","year":"2002","unstructured":"Shawe-Taylor, J., Williams, C., Cristianini, N., Kandola, J.: On the eigenspectrum of the Gram matrix and its relationship to the operator eigenspectrum. In: Cesa- Bianchi, N., Numao, M., Reischuk, R. (eds.) Proceedings of the 13th International Conference on Algorithmic Learning Theory, Springer, Heidelberg (2002)"},{"issue":"8","key":"32_CR24","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 Transactions on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Van Driessche, R., Roose, D.: An improved spectral bisection algorithm and its application to dynamic load balancing. Parallel Comput.\u00a021(1) (1995)","DOI":"10.1016\/0167-8191(94)00059-J"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"von Luxburg, U., Bousquet, O., Belkin, M.: On the convergence of spectral clustering on random samples: the unnormalized case. Submitted to DAGM (2004), available at http:\/\/www.kyb.tuebingen.mpg.de\/~ule","DOI":"10.1007\/978-3-540-27819-1_32"},{"key":"32_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6027-1","volume-title":"Linear Operators in Hilbert spaces","author":"J. Weidmann","year":"1980","unstructured":"Weidmann, J.: Linear Operators in Hilbert spaces. Springer, New York (1980)"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Weiss, Y.: Segmentation using eigenvectors: A unifying view. In: Proceedings of the International Conference on Computer Vision, pp. 975\u2013982 (1999)","DOI":"10.1109\/ICCV.1999.790354"},{"key":"32_CR29","first-page":"1159","volume-title":"Proceedings of the 17th International Conference on Machine Learning","author":"C.K.I. Williams","year":"2000","unstructured":"Williams, C.K.I., Seeger, M.: The effect of the input density distribution on kernel based classifiers. In: Langley, P. (ed.) Proceedings of the 17th International Conference on Machine Learning, pp. 1159\u20131166. Morgan Kaufmann, San Francisco (2000)"},{"key":"32_CR30","volume-title":"Proceedings of the 20th International Conference of Machine Learning","author":"X. Zhu","year":"2003","unstructured":"Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using Gaussianfields and harmonic functions. In: Fawcett, T., Mishra, N. (eds.) Proceedings of the 20th International Conference of Machine Learning, AAAI Press, Menlo Park (2003)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27819-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T21:04:18Z","timestamp":1636491858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27819-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222828","9783540278191"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27819-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}