Sciweavers

1393 search results - page 101 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
2007
IEEE
16 years 2 months ago
On one method of non-diagonal regularization in sparse Bayesian learning
In the paper we propose a new type of regularization procedure for training sparse Bayesian methods for classification. Transforming Hessian matrix of log-likelihood function to d...
Dmitry Kropotov, Dmitry Vetrov
AVSS
2006
IEEE
15 years 5 months ago
Classification-Based Likelihood Functions for Bayesian Tracking
The success of any Bayesian particle filtering based tracker relies heavily on the ability of the likelihood function to discriminate between the state that fits the image well an...
Chunhua Shen, Hongdong Li, Michael J. Brooks
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
15 years 3 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
125
Voted
AAMAS
2004
Springer
15 years 1 months ago
Functional Validation in Grid Computing
The development of the World Wide Web has changed the way we think about information. Information on the web is distributed, updates are made asynchronously and resources come onli...
Guofei Jiang, George Cybenko
IJCNN
2006
IEEE
15 years 8 months ago
Bi-directional Modularity to Learn Visual Servoing Tasks
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban