NIPS 2003 - PDF Preprint Papers

NIPS 2003

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NIPS-2003 Paper

click to vote

NIPS
2003

289views Information Technology» more NIPS 2003»

Gaussian Process Latent Variable Models for Visualisation of High Dimensional Data

14 years 24 days ago

Download books.nips.cc

In this paper we introduce a new underlying probabilistic model for principal component analysis (PCA). Our formulation interprets PCA as a particular Gaussian process prior on a ...

Neil D. Lawrence

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	289	Gaussian Process Latent Variable Models for Visualisation of High Dimensional Data	claim
2	268	Eye Movements for Reward Maximization	claim
3	227	Attractive People: Assembling Loose-Limbed Models using Non-parametric Belief Propagation	claim
4	222	Mutual Boosting for Contextual Inference	claim
5	221	Learning Non-Rigid 3D Shape from 2D Motion	claim
6	211	Dynamical Modeling with Kernels for Nonlinear Time Series Prediction	claim
7	207	Extending Q-Learning to General Adaptive Multi-Agent Systems	claim
8	202	Max-Margin Markov Networks	claim
9	197	1-norm Support Vector Machines	claim
10	196	Approximate Policy Iteration with a Policy Language Bias	claim
11	195	AUC Optimization vs. Error Rate Minimization	claim
12	192	Approximability of Probability Distributions	claim
13	191	Approximate Expectation Maximization	claim
14	189	Sparse Representation and Its Applications in Blind Source Separation	claim
15	187	The IM Algorithm: A Variational Approach to Information Maximization	claim
16	186	Perspectives on Sparse Bayesian Learning	claim
17	184	Link Prediction in Relational Data	claim
18	183	Learning a Distance Metric from Relative Comparisons	claim
19	180	Bounded Finite State Controllers	claim
20	179	Automatic Annotation of Everyday Movements	claim
21	179	Computing Gaussian Mixture Models with EM Using Equivalence Constraints	claim
22	177	Laplace Propagation	claim
23	175	Boosting versus Covering	claim
24	172	Sequential Bayesian Kernel Regression	claim
25	172	A Mixed-Signal VLSI for Real-Time Generation of Edge-Based Image Vectors	claim
26	171	A Computational Geometric Approach to Shape Analysis in Images	claim
27	170	Minimax Embeddings	claim
28	169	A Classification-based Cocktail-party Processor	claim
29	168	Can We Learn to Beat the Best Stock	claim
30	168	A Sampled Texture Prior for Image Super-Resolution	claim
31	167	When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?	claim
32	167	Factorization with Uncertainty and Missing Data: Exploiting Temporal Coherence	claim
33	167	Applying Metric-Trees to Belief-Point POMDPs	claim
34	166	Training a Quantum Neural Network	claim
35	164	Linear Response for Approximate Inference	claim
36	163	Sensory Modality Segregation	claim
37	162	Nonlinear Processing in LGN Neurons	claim
38	160	Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data	claim
39	158	Reasoning about Time and Knowledge in Neural Symbolic Learning Systems	claim
40	158	Envelope-based Planning in Relational MDPs	claim
41	157	A Model for Learning the Semantics of Pictures	claim
42	157	GPPS: A Gaussian Process Positioning System for Cellular Networks	claim
43	157	Kernels for Structured Natural Language Data	claim
44	156	Learning to Find Pre-Images	claim
45	156	Clustering with the Connectivity Kernel	claim
46	156	Linear Program Approximations for Factored Continuous-State Markov Decision Processes	claim
47	155	ARA: Anytime A with Provable Bounds on Sub-Optimality	claim
48	154	Algorithms for Interdependent Security Games	claim
49	153	Multiple-Instance Learning via Disjunctive Programming Boosting	claim
50	152	Learning Near-Pareto-Optimal Conventions in Polynomial Time	claim
51	151	An Autonomous Robotic System for Mapping Abandoned Mines	claim
52	151	Kernel Dimensionality Reduction for Supervised Learning	claim
53	151	Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms	claim
54	149	Analytical Solution of Spike-timing Dependent Plasticity Based on Synaptic Biophysics	claim
55	148	Approximate Planning in POMDPs with Macro-Actions	claim
56	147	Auction Mechanism Design for Multi-Robot Coordination	claim
57	147	Markov Models for Automated ECG Interval Analysis	claim
58	147	Nonstationary Covariance Functions for Gaussian Process Regression	claim
59	147	Design of Experiments via Information Theory	claim
60	147	Learning a Rare Event Detection Cascade by Direct Feature Selection	claim
61	146	On the Concentration of Expectation and Approximate Inference in Layered Networks	claim
62	145	A Low-Power Analog VLSI Visual Collision Detector	claim
63	145	A Nonlinear Predictive State Representation	claim
64	145	Non-linear CCA and PCA by Alignment of Local Models	claim
65	144	Convex Methods for Transduction	claim
66	144	Margin Maximizing Loss Functions	claim
67	144	Warped Gaussian Processes	claim
68	144	Learning with Local and Global Consistency	claim
69	142	Semi-Supervised Learning with Trees	claim
70	142	A Biologically Plausible Algorithm for Reinforcement-shaped Representational Learning	claim
71	142	A Holistic Approach to Compositional Semantics: A Connectionist Model and Robot Experiments	claim
72	141	Image Reconstruction by Linear Programming	claim
73	141	Salient Boundary Detection using Ratio Contour	claim
74	140	Gene Expression Clustering with Functional Mixture Models	claim
75	139	Locality Preserving Projections	claim
76	139	Dopamine Modulation in a Basal Ganglio-cortical Network Implements Saliency-based Gating of Working Memory	claim
77	139	Maximum Likelihood Estimation of a Stochastic Integrate-and-Fire Neural Model	claim
78	139	Bayesian Color Constancy with Non-Gaussian Models	claim
79	138	Linear Dependent Dimensionality Reduction	claim
80	137	Online Passive-Aggressive Algorithms	claim
81	136	An Improved Scheme for Detection and Labelling in Johansson Displays	claim
82	135	Learning Bounds for a Generalized Family of Bayesian Posterior Distributions	claim
83	134	Pairwise Clustering and Graphical Models	claim
84	134	Entrainment of Silicon Central Pattern Generators for Legged Locomotory Control	claim
85	133	Prediction on Spike Data Using Kernel Algorithms	claim
86	133	ICA-based Clustering of Genes from Microarray Expression Data	claim
87	132	Ambiguous Model Learning Made Unambiguous with 1/f Priors	claim
88	132	Large Scale Online Learning	claim
89	131	Discriminative Fields for Modeling Spatial Dependencies in Natural Images	claim
90	130	Eigenvoice Speaker Adaptation via Composite Kernel PCA	claim
91	130	Inferring State Sequences for Non-linear Systems with Embedded Hidden Markov Models	claim
92	130	On the Dynamics of Boosting	claim
93	129	PAC-Bayesian Generic Chaining	claim
94	129	A Functional Architecture for Motion Pattern Processing in MSTd	claim
95	129	Probabilistic Inference in Human Sensorimotor Processing	claim
96	129	Nonlinear Filtering of Electron Micrographs by Means of Support Vector Regression	claim
97	128	Hierarchical Topic Models and the Nested Chinese Restaurant Process	claim
98	128	Distributed Optimization in Adaptive Networks	claim
99	128	Geometric Clustering Using the Information Bottleneck Method	claim
100	127	Log-Linear Models for Label Ranking	claim
101	127	Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis	claim
102	127	Ranking on Data Manifolds	claim
103	126	Robustness in Markov Decision Problems with Uncertain Transition Matrices	claim
104	124	Denoising and Untangling Graphs Using Degree Priors	claim
105	123	Model Uncertainty in Classical Conditioning	claim
106	123	Error Bounds for Transductive Learning via Compression and Clustering	claim
107	122	Phonetic Speaker Recognition with Support Vector Machines	claim
108	121	Approximate Analytical Bootstrap Averages for Support Vector Classifiers	claim
109	121	A Summating, Exponentially-Decaying CMOS Synapse for Spiking Neural Systems	claim
110	120	Predicting Speech Intelligibility from a Population of Neurons	claim
111	120	Tree-structured Approximations by Expectation Propagation	claim
112	120	The Diffusion-Limited Biochemical Signal-Relay Channel	claim
113	120	Human and Ideal Observers for Detecting Image Curves	claim
114	119	All learning is Local: Multi-agent Learning in Global Reward Games	claim
115	119	Minimising Contrastive Divergence in Noisy, Mixed-mode VLSI Neurons	claim
116	119	Online Learning of Non-stationary Sequences	claim
117	119	Unsupervised Color Decomposition Of Histologically Stained Tissue Samples	claim
118	118	Online Learning via Global Feedback for Phrase Recognition	claim
119	118	A Neuromorphic Multi-chip Model of a Disparity Selective Complex Cell	claim
120	118	Learning Curves for Stochastic Gradient Descent in Linear Feedforward Networks	claim
121	117	Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering	claim
122	116	The Doubly Balanced Network of Spiking Neurons: A Memory Model with High Capacity	claim
123	116	Perception of the Structure of the Physical World Using Unknown Multimodal Sensors and Effectors	claim
124	116	Unsupervised Context Sensitive Language Acquisition from a Large Corpus	claim
125	115	From Algorithmic to Subjective Randomness	claim
126	114	Subject-Independent Magnetoencephalographic Source Localization by a Multilayer Perceptron	claim
127	114	Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons	claim
128	113	Mechanism of Neural Interference by Transcranial Magnetic Stimulation: Network or Single Neuron?	claim
129	113	Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds	claim
130	112	Statistical Debugging of Sampled Programs	claim
131	111	No Unbiased Estimator of the Variance of K-Fold Cross-Validation	claim
132	110	Variational Linear Response	claim
133	110	Reconstructing MEG Sources with Unknown Correlations	claim
134	108	Policy Search by Dynamic Programming	claim
135	107	Increase Information Transfer Rates in BCI by CSP Extension to Multi-class	claim
136	107	Insights from Machine Learning Applied to Human Visual Classification	claim
137	107	Bias-Corrected Bootstrap and Model Uncertainty	claim
138	106	Synchrony Detection by Analogue VLSI Neurons with Bimodal STDP Synapses	claim
139	106	Optimal Manifold Representation of Data: An Information Theoretic Approach	claim
140	105	Probabilistic Inference of Speech Signals from Phaseless Spectrograms	claim
141	105	An MCMC-Based Method of Comparing Connectionist Models in Cognitive Science	claim
142	105	Gaussian Processes in Reinforcement Learning	claim
143	104	Measure Based Regularization	claim
144	104	Wormholes Improve Contrastive Divergence	claim
145	104	One Microphone Blind Dereverberation Based on Quasi-periodicity of Speech Signals	claim
146	101	Extreme Components Analysis	claim
147	100	Identifying Structure across Pre-partitioned Data	claim
148	99	Decoding V1 Neuronal Activity using Particle Filtering with Volterra Kernels	claim
149	98	A Kullback-Leibler Divergence Based Kernel for SVM Classification in Multimedia Applications	claim
150	97	A Recurrent Model of Orientation Maps with Simple and Complex Cells	claim
151	95	An Iterative Improvement Procedure for Hierarchical Clustering	claim
152	93	Learning the k in k-means	claim
153	93	Limiting Form of the Sample Covariance Eigenspectrum in PCA and Kernel PCA	claim
154	91	Sample Propagation	claim
155	91	Learning a World Model and Planning with a Self-Organizing, Dynamic Neural System	claim
156	91	Local Phase Coherence and the Perception of Blur	claim
157	90	An MDP-Based Approach to Online Mechanism Design	claim
158	90	Discriminating Deformable Shape Classes	claim
159	90	Feature Selection in Clustering Problems	claim
160	88	A Probabilistic Model of Auditory Space Representation in the Barn Owl	claim
161	86	Information Bottleneck for Gaussian Variables	claim
162	86	Simplicial Mixtures of Markov Chains: Distributed Modelling of Dynamic User Profiles	claim
163	83	Learning Spectral Clustering	claim
164	76	Self-calibrating Probability Forecasting	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers