Sciweavers

1419 search results - page 234 / 284
» Approximation Methods for Supervised Learning
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 8 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
ICCV
2009
IEEE
13 years 6 months ago
Complex volume and pose tracking with probabilistic dynamical models and visual hull constraints
We propose a method for estimating the pose of a human body using its approximate 3D volume (visual hull) obtained in real time from synchronized videos. Our method can cope with ...
Norimichi Ukita, Michiro Hirai, Masatsugu Kidode
SIGMOD
2009
ACM
177views Database» more  SIGMOD 2009»
14 years 9 months ago
Exploiting context analysis for combining multiple entity resolution systems
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
BMCBI
2006
165views more  BMCBI 2006»
13 years 8 months ago
Improved variance estimation of classification performance via reduction of bias caused by small sample size
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
Ulrika Wickenberg-Bolin, Hanna Göransson, M&a...
CIKM
2010
Springer
13 years 6 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan