Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Matrix computations (3rd ed.)
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Journal of Machine Learning Research
Generalized Discriminant Analysis Using a Kernel Approach
Neural Computation
Probabilistic latent semantic visualization: topic model for visualizing documents
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Effective Visualization of Information Diffusion Process over Complex Networks
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
RAST: A Related Abstract Search Tool
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
Information Retrieval Perspective to Nonlinear Dimensionality Reduction for Data Visualization
The Journal of Machine Learning Research
Relevance learning in generative topographic mapping
Neurocomputing
A general framework for dimensionality-reducing data visualization mapping
Neural Computation
Discriminative dimensionality reduction mappings
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
| Hi-index | 0.00 |
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.