{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:07:35Z","timestamp":1774951655132,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642409349","type":"print"},{"value":"9783642409356","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_26","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T05:14:50Z","timestamp":1380258890000},"page":"367-381","source":"Crossref","is-referenced-by-count":29,"title":["Fast Spectral Clustering via the Nystr\u00f6m Method"],"prefix":"10.1007","author":[{"given":"Anna","family":"Choromanska","sequence":"first","affiliation":[]},{"given":"Tony","family":"Jebara","sequence":"additional","affiliation":[]},{"given":"Hyungtae","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Mahesh","family":"Mohan","sequence":"additional","affiliation":[]},{"given":"Claire","family":"Monteleoni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Belkin, M., Niyogi, P.: Convergence of Laplacian eigenmaps. In: NIPS 2006, pp. 129\u2013136. MIT Press (2007)","DOI":"10.7551\/mitpress\/7503.003.0021"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M.W.: On the Nystr\u00f6m Method for Approximating a Gram Matrix for Improved Kernel-Based Learning. Journal of Machine Learning Research 6, 2005 (2005)","DOI":"10.1007\/11503415_22"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/TPAMI.2004.1262185","volume":"26","author":"C. Fowlkes","year":"2004","unstructured":"Fowlkes, C., Belongie, S., Chung, F., Malik, J.: Spectral grouping using the nystr\u00f6m method. IEEE Trans. Pattern Anal. Mach. Intell.\u00a026(2), 214\u2013225 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Fung, W.S., Hariharan, R., Harvey, N.J., Panigrahi, D.: A general framework for graph sparsification. In: STOC (2011)","DOI":"10.1145\/1993636.1993647"},{"issue":"3-4","key":"26_CR5","first-page":"157","volume":"4","author":"R. Kannan","year":"2009","unstructured":"Kannan, R., Vempala, S.: Spectral algorithms. Foundations and Trends in Theoretical Computer Science\u00a04(3-4), 157\u2013288 (2009)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"26_CR6","first-page":"304","volume":"5","author":"S. Kumar","year":"2009","unstructured":"Kumar, S., Mohri, M., Talwalkar, A.: Sampling techniques for the nystr\u00f6m method. Journal of Machine Learning Research\u00a05, 304\u2013311 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"26_CR7","unstructured":"Lashkari, D., Golland, P.: Convex clustering with exemplar-based models. In: NIPS 2007 (2007)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Li, M., Lian, X.-C., Kwok, J.T., Lu, B.-L.: Time and space efficient spectral clustering via column sampling. In: 24th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2011, pp. 2297\u20132304. IEEE (2011)","DOI":"10.1109\/CVPR.2011.5995425"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S.P. Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in pcm. IEEE Transactions on Information Theory\u00a028, 129\u2013137 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"26_CR10","doi-asserted-by":"publisher","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. Statistics and Computing\u00a017(4), 395\u2013416 (2007)","journal-title":"Statistics and Computing"},{"key":"26_CR11","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS 2001, pp. 849\u2013856. MIT Press (2001)"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"D.A. Spielman","year":"2011","unstructured":"Spielman, D.A., Teng, S.-H.: Spectral sparsification of graphs. SIAM Journal on Computing\u00a040(4), 981\u20131025 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR13","unstructured":"Williams, C., Seeger, M.: Using the Nystr\u00f6m method to speed up kernel machines. In: NIPS 2000, pp. 682\u2013688. MIT Press (2001)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Yan, D., Huang, L., Jordan, M.I.: Fast approximate spectral clustering. In: ACM SIGKDD, pp. 907\u2013916. ACM (2009)","DOI":"10.1145\/1557019.1557118"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T21:23:06Z","timestamp":1688505786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}