Sciweavers

977 search results - page 96 / 196
» Constructing informative priors using transfer learning
Sort
View
NIPS
2004
15 years 6 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
JMLR
2002
106views more  JMLR 2002»
15 years 4 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
PASTE
2010
ACM
15 years 9 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
AAAI
2008
15 years 6 months ago
A Demonstration of the RADAR Personal Assistant
Email clients were not designed to serve as a task management tools, but a high volume of task-relevant information in email leads many people to use email clients for this purpos...
Andrew Faulring, Brad A. Myers, Ken Mohnkern, Mich...
151
Voted
NIPS
2007
15 years 6 months ago
People Tracking with the Laplacian Eigenmaps Latent Variable Model
Reliably recovering 3D human pose from monocular video requires models that bias the estimates towards typical human poses and motions. We construct priors for people tracking usi...
Zhengdong Lu, Miguel Á. Carreira-Perpi&ntil...