Skip to main navigation Skip to search Skip to main content

Generalized clustering via kernel embeddings

  • Stefanie Jegelka
  • , Arthur Gretton
  • , Bernhard Schölkopf
  • , Bharath K. Sriperumbudur
  • , Ulrike Von Luxburg
  • Max Planck Institute for Biological Cybernetics
  • Carnegie Mellon University
  • University of California

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

29 Scopus citations

Abstract

We generalize traditional goals of clustering towards distinguishing components in a non-parametric mixture model. The clusters are not necessarily based on point locations, but on higher order criteria. This framework can be implemented by embedding probability distributions in a Hilbert space. The corresponding clustering objective is very general and relates to a range of common clustering concepts.

Original languageEnglish
Title of host publicationKI 2009
Subtitle of host publicationAdvances in Artificial Intelligence - 32nd Annual German Conference on AI, Proceedings
Pages144-152
Number of pages9
DOIs
StatePublished - 2009
Externally publishedYes
Event32nd Annual German Conference on Artificial Intelligence, KI 2009 - Paderborn, Germany
Duration: 15 Sep 200918 Sep 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5803 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference32nd Annual German Conference on Artificial Intelligence, KI 2009
Country/TerritoryGermany
CityPaderborn
Period15/09/0918/09/09

Fingerprint

Dive into the research topics of 'Generalized clustering via kernel embeddings'. Together they form a unique fingerprint.

Cite this