Sciweavers

3837 search results - page 499 / 768
» Learning Approximate Consistencies
Sort
View
JMLR
2008
110views more  JMLR 2008»
15 years 6 months ago
Cross-Validation Optimization for Large Scale Structured Classification Kernel Methods
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
Matthias W. Seeger
JFR
2006
88views more  JFR 2006»
15 years 6 months ago
Discovering natural kinds of robot sensory experiences in unstructured environments
We derive categories directly from robot sensor data to address the symbol grounding problem. Unlike model-based approaches where human intuitive correspondences are sought betwee...
Daniel H. Grollman, Odest Chadwicke Jenkins, Frank...
JMLR
2006
138views more  JMLR 2006»
15 years 6 months ago
Noisy-OR Component Analysis and its Application to Link Analysis
We develop a new component analysis framework, the Noisy-Or Component Analyzer (NOCA), that targets high-dimensional binary data. NOCA is a probabilistic latent variable model tha...
Tomás Singliar, Milos Hauskrecht
PAMI
2006
147views more  PAMI 2006»
15 years 6 months ago
Bayesian Gaussian Process Classification with the EM-EP Algorithm
Gaussian process classifiers (GPCs) are Bayesian probabilistic kernel classifiers. In GPCs, the probability of belonging to a certain class at an input location is monotonically re...
Hyun-Chul Kim, Zoubin Ghahramani
ML
2002
ACM
135views Machine Learning» more  ML 2002»
15 years 6 months ago
Bayesian Treed Models
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
Hugh A. Chipman, Edward I. George, Robert E. McCul...