Sciweavers

922 search results - page 110 / 185
» Learning Gaussian Process Models from Uncertain Data
Sort
View
138
Voted
ICASSP
2011
IEEE
14 years 6 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
147
Voted
CVPR
2008
IEEE
16 years 4 months ago
Learning Bayesian Networks with qualitative constraints
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
Yan Tong, Qiang Ji
169
Voted
JMLR
2012
13 years 5 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
135
Voted
ASC
2008
15 years 2 months ago
Info-fuzzy algorithms for mining dynamic data streams
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
141
Voted
CVPR
2012
IEEE
13 years 5 months ago
Multi-target tracking by online learning of non-linear motion patterns and robust appearance models
We describe an online approach to learn non-linear motion patterns and robust appearance models for multi-target tracking in a tracklet association framework. Unlike most previous...
Bo Yang, Ram Nevatia