{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:54:03Z","timestamp":1725537243207},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046162"},{"type":"electronic","value":"9783642046179"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04617-9_19","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T10:55:02Z","timestamp":1253012102000},"page":"144-152","source":"Crossref","is-referenced-by-count":21,"title":["Generalized Clustering via Kernel Embeddings"],"prefix":"10.1007","author":[{"given":"Stefanie","family":"Jegelka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur","family":"Gretton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Sch\u00f6lkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bharath K.","family":"Sriperumbudur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrike","family":"von Luxburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aghagolzadeh, M., Soltanian-Zadeh, H., Araabi, B., Aghagolzadeh, A.: A hierarchical clustering based on maximizing mutual information. In: ICIP (2007)","DOI":"10.1109\/ICIP.2007.4378945"},{"key":"19_CR2","unstructured":"Arora, S., Kannan, R.: Learning mixtures of arbitrary Gaussians. In: STOC (2001)"},{"key":"19_CR3","unstructured":"Chaudhuri, K., Rao, S.: Beyond Gaussians: Spectral methods for learning mixtures of heavy-tailed distributions. In: COLT (2008)"},{"issue":"6","key":"19_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/SP-M.2006.248709","volume":"23","author":"D. Erdogmus","year":"2006","unstructured":"Erdogmus, D., Principe, J.C.: From linear adaptive filtering to nonlinear information processing. IEEE Signal Processing Magazine\u00a023(6), 14\u201333 (2006)","journal-title":"IEEE Signal Processing Magazine"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Fuglede, B., Tops\u00f8e, F.: Jensen-Shannon divergence and Hilbert space embedding. In: Proc. of the Int. Symp. on Information Theory, ISIT (2004)","DOI":"10.1109\/ISIT.2004.1365067"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/34.982897","volume":"24","author":"E. Gokcay","year":"2002","unstructured":"Gokcay, E., Principe, J.C.: Information theoretic clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a024(2), 158\u2013170 (2002)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"19_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11564089_7","volume-title":"Algorithmic Learning Theory","author":"A. Gretton","year":"2005","unstructured":"Gretton, A., Bousquet, O., Smola, A., Sch\u00f6lkopf, B.: Measuring statistical dependence with Hilbert-Schmidt norms. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol.\u00a03734, pp. 63\u201377. Springer, Heidelberg (2005)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Gretton, A., Borgwardt, K.M., Rasch, M., Sch\u00f6lkopf, B., Smola, A.: A kernel method for the two-sample problem. In: NIPS (2006)","DOI":"10.7551\/mitpress\/7503.003.0069"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gretton, A., Borgwardt, K., Rasch, M., Sch\u00f6lkopf, B., Smola, A.: A kernel method for the two-sample problem. Tech. Report 157, MPI for Biol. Cyb. (2008)","DOI":"10.7551\/mitpress\/7503.003.0069"},{"key":"19_CR10","unstructured":"Jenssen, R., Erdogmus, D., Principe, J., Eltoft, T.: The laplacian pdf distance: a cost function for clustering in a kernel feature space. In: NIPS (2004)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Lin, J.: Divergence measures based on the Shannon entropy. IEEE Transaction on Information Theory\u00a037(1) (1991)","DOI":"10.1109\/18.61115"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical review E\u00a069 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"19_CR13","unstructured":"Renyi, A.: On measures of entropy and information. In: Proc. Fourth Berkeley Symp. Math., Statistics and Probability, pp. 547\u2013561 (1960)"},{"issue":"6","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1109\/18.340468","volume":"40","author":"K. Rose","year":"1994","unstructured":"Rose, K.: A mapping approach to rate-distortion computation and analysis. IEEE Transactions on Information Theory\u00a040(6), 1939\u20131952 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Song, L., Smola, A., Gretton, A., Borgwardt, K.: A dependence maximization view of clustering. In: 24th International Conference on Machine Learning, ICML (2007)","DOI":"10.1145\/1273496.1273599"},{"key":"19_CR16","unstructured":"Sriperumbudur, B.K., Gretton, A., Fukumizu, K., Lanckriet, G., Sch\u00f6lkopf, B.: Injective Hilbert space embeddings of probability measures. In: COLT (2008)"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A. W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming\u00a0106(1), 25\u201357 (2006)","journal-title":"Mathematical Programming"},{"key":"19_CR18","unstructured":"Xu, L., Neufeld, J., Larson, B., Schuurmans, D.: Maximum margin clustering. In: NIPS (2005)"}],"container-title":["Lecture Notes in Computer Science","KI 2009: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04617-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T14:19:46Z","timestamp":1710598786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04617-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046162","9783642046179"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04617-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}