{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:35Z","timestamp":1725488975632},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741954"},{"type":"electronic","value":"9783540741985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74198-5_2","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T03:34:48Z","timestamp":1186976088000},"page":"13-27","source":"Crossref","is-referenced-by-count":9,"title":["Szemer\u00e9di\u2019s Regularity Lemma and Its Applications to Pairwise Clustering and Segmentation"],"prefix":"10.1007","author":[{"given":"Anna","family":"Sperotto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1006\/jagm.1994.1005","volume":"16","author":"N. Alon","year":"1994","unstructured":"Alon, N., Duke, R.A., Lefmann, H., R\u00f6dl, V., Yuster, R.: The algorithmic aspects of the regularity lemma. J. of Algorithms\u00a016, 80\u2013109 (1994) (also in Proc. 33rd IEEE FOCS, Pittsburgh, IEEE, 473\u2013481 (1992))","journal-title":"J. of Algorithms"},{"key":"2_CR2","volume-title":"Advances in Neural Information Processing Systems 16","author":"Y. Bengio","year":"2004","unstructured":"Bengio, Y., Paiement, J., Vincent, P., Delalleau, O., Roux, N.L., Ouimet, M.: Out-of-sample extensions for lle, isomap, mds, eigenmaps, and spectral clustering. In: Thrun, S., Saul, L., Sch\u00f6lkopf, B. (eds.) Advances in Neural Information Processing Systems 16, MIT Press, Cambridge, MA (2004)"},{"key":"2_CR3","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"key":"2_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, MA (2001)","edition":"2"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1137\/S0097539799351729","volume":"30","author":"A. Czygrinow","year":"2000","unstructured":"Czygrinow, A., R\u00f6dl, V.: An algorithmic regularity lemma for hypergraphs. SIAM J. Comput.\u00a030(4), 1041\u20131066 (2000)","journal-title":"SIAM J. Comput."},{"key":"2_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, New York (2005)","edition":"3"},{"key":"2_CR7","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.R.K., Malik, J.: Spectral grouping using the Nystr\u00f6m method. IEEE Trans. Pattern Anal. Mach. Intell.\u00a026, 214\u2013225 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Frieze, A.M., Kannan, R.: A simple algorithm for constructing Szemer\u00e9di\u2019s regularity partition. Electron. J. Comb. 6 (1999)","DOI":"10.37236\/1449"},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S0097539702408223","volume":"32","author":"Y. Kohayakawa","year":"2003","unstructured":"Kohayakawa, Y., R\u00f6dl, V., Thoma, L.: An optimal algorithm for checking regularity. SIAM J. Comput.\u00a032(5), 1210\u20131235 (2003)","journal-title":"SIAM J. Comput."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-45878-6_3","volume-title":"Theoretical Aspects of Computer Science: Advanced Lectures","author":"J. Koml\u00f3s","year":"2002","unstructured":"Koml\u00f3s, J., Shokoufandeh, A., Simonovits, M., Szemer\u00e9di, E.: The regularity lemma and its applications in graph theory. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, A. (eds.) Theoretical Aspects of Computer Science: Advanced Lectures, pp. 84\u2013112. Springer, New York (2002)"},{"key":"2_CR11","unstructured":"Koml\u00f3s, J., Simonovits, M.: Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory. In: Mikl\u00f3s, D., Szonyi, T., S\u00f3s, V.T. (eds.) Combinatorics, Paul Erd\u00f6s is Eighty (vol. 2), pp. 295\u2013352. Bolyai Society Mathematical Studies 2, Budapest (1996)"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Canad. J. Math.\u00a017, 533\u2013540 (1965)","journal-title":"Canad. J. Math."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TPAMI.2007.250608","volume":"29","author":"M. Pavan","year":"2007","unstructured":"Pavan, M., Pelillo, M.: Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Mach. Intell.\u00a029, 167\u2013172 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR14","first-page":"1057","volume-title":"Advances in Neural Information Processing Systems 17","author":"M. Pavan","year":"2005","unstructured":"Pavan, M., Pelillo, M.: Efficient out-of-sample extension of dominant-set clusters. In: Saul, L.K., Weiss, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems 17, pp. 1057\u20131064. MIT Press, Cambridge, MA (2005)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1109\/TPAMI.2003.1251147","volume":"25","author":"V. Roth","year":"2003","unstructured":"Roth, V., Laub, J., Kawanabe, M., Buhmann, J.M.: Optimal cluster preserving embedding of nonmetric proximity data. IEEE Trans. Pattern Anal. Mach. Intell.\u00a025, 1540\u20131551 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR16","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Colloques Internationaux CNRS 260\u2014Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Orsay, pp. 399\u2013401 (1976)"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74198-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:19:07Z","timestamp":1605763147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74198-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741954","9783540741985"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74198-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}