title: Parametric embedding for class visualization.
abstract: We propose a new method, parametric embedding (PE), that embeds objects with the class structure into a low-dimensional visualization space. PE takes as input a set of class conditional probabilities for given data points and tries to preserve the structure in an embedding space by minimizing a sum of Kullback-Leibler divergences, under the assumption that samples are generated by a gaussian mixture with equal covariances in the embedding space. PE has many potential uses depending on the source of the input data, providing insight into the classifier's behavior in supervised, semisupervised, and unsupervised settings. The PE algorithm has a computational advantage over conventional embedding methods based on pairwise object relations since its complexity scales with the product of the number of objects and the number of classes. We demonstrate PE by visualizing supervised categorization of Web pages, semisupervised categorization of digits, and the relations of words and latent topics found by an unsupervised algorithm, latent Dirichlet allocation.
authors.affiliation: NTT Communication Science Laboratories, Kyoto, Japan. iwata@cslab.kecl.ntt.co.jp
authors.forename: Tomoharu
authors.initials: T
authors.lastname: Iwata
authors.forename: Kazumi
authors.initials: K
authors.lastname: Saito
authors.forename: Naonori
authors.initials: N
authors.lastname: Ueda
authors.forename: Sean
authors.initials: S
authors.lastname: Stromsten
authors.forename: Thomas L
authors.initials: TL
authors.lastname: Griffiths
authors.forename: Joshua B
authors.initials: JB
authors.lastname: Tenenbaum
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D006801:Humans; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated