Continuous nonlinear dimensionality reduction by kernel eigenmaps

Authors:
Matthew Brand
Affiliations:
Mitsubishi Electric Research Laboratories, Cambridge, MA
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 1
Cited 10

Dimension reduction by local principal component analysis

Neural Computation

A Bernoulli Relational Model for Nonlinear Embedding

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
High-Dimensional Visual Analytics: Interactive Exploration Guided by Pairwise Views of Point Distributions

IEEE Transactions on Visualization and Computer Graphics
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust locally linear embedding

Pattern Recognition
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples

The Journal of Machine Learning Research
Audio-visual human recognition using semi-supervised spectral learning and hidden Markov models

Journal of Visual Languages and Computing
A convergent solution to tensor subspace learning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Graph embedding with constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Feature Extraction Using a Complete Kernel Extension of Supervised Graph Embedding

Neural Processing Letters
Graph drawing by subspace optimization

VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization

Quantified Score

Hi-index	0.01

Visualization

Abstract

Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is closely tied to how accurately data values are predicted at runtime. Caching ...