Colored Maximum Variance Unfolding
Explore this paper's citation graph
Summary
It is shown that MVU also optimizes a statistical dependence measure which aims to retain the identity of individual observations under the distance-preserving constraints, which allows for "colored" variants of MVU, which produce low-dimensional representations for a given task.
- Type
- article
- Published
- 2007-12-03
- Cited by
- 114
- References
- 9
- OpenAlex
- https://openalex.org/W2120481923
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:16048365
Keywords
Variance (accounting), Computer science, Heuristic, Representation (politics), Dimensionality reduction
References
- Learning a kernel matrix for nonlinear dimensionality reduction
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Supervised feature selection via dependence estimation
- A dependence maximization view of clustering
- Neighbourhood Components Analysis
- Dimensionality Reduction for Supervised Learning with Reproducing Kernel Hilbert Spaces
- Graph Laplacian Regularization for Large-Scale Semidefinite Programming
- Measuring Statistical Dependence with Hilbert-Schmidt Norms
- Graph Laplacian Regularization for Large-Scale Semidefinite Programming
Cited by
- Advances in dissimilarity-based data visualisation
- Feature-based transfer learning with real-world applications
- Canonical locality preserving Latent Variable Model for discriminative pose inference
- Modeling of mutual dependencies
- Domain Adaptation via Transfer Component Analysis
- Nonlinear Dynamic Field Embedding: On Hyperspectral Scene Visualization
- Gradient-based kernel dimension reduction for supervised learning
- Multilabel dimensionality reduction via dependence maximization
- Generalized sparse metric learning with relative comparisons
- Adaptive Dissimilarity Measures, Dimension Reduction and Visualization (University of Groningen)
- Ideal regularization for learning kernels from labels
- Non-parametric kernel ranking approach for social image retrieval
- Supervised principal component analysis: Visualization, classification and regression on subspaces and submanifolds
- Adaptive weighted learning for linear regression problems via Kullback-Leibler divergence
- Gradient-Based Kernel Dimension Reduction for Regression
- Dimensionality reduction by Mixed Kernel Canonical Correlation Analysis
- Scalable Nonparametric Low-Rank Kernel Learning Using Block Coordinate Descent
- Hyperparameter Selection in Kernel Principal Component Analysis
- Data visualization by nonlinear dimensionality reduction
- Geometry-aware metric learning
Related papers
- Learning a kernel matrix for nonlinear dimensionality reduction
- A global geometric framework for nonlinear dimensionality reduction.
- Nonlinear dimensionality reduction by locally linear embedding.
- Nonlinear Component Analysis as a Kernel Eigenvalue Problem
- Stochastic Neighbor Embedding
- Distance Metric Learning with Application to Clustering with Side-Information
- Neighbourhood Components Analysis
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS