Sciweavers

510 search results - page 60 / 102
» Sparse probabilistic projections
Sort
View
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
14 years 9 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld
ICDM
2007
IEEE
289views Data Mining» more  ICDM 2007»
14 years 3 months ago
Latent Dirichlet Conditional Naive-Bayes Models
In spite of the popularity of probabilistic mixture models for latent structure discovery from data, mixture models do not have a natural mechanism for handling sparsity, where ea...
Arindam Banerjee, Hanhuai Shan
COLING
2000
13 years 10 months ago
Decision-Tree based Error Correction for Statistical Phrase Break Prediction in Korean
tn this paper, we present a new 1)hrase break prediction architecture that integrates probabilistic apt)roach with decision-tree based error correction. The probabilistic method a...
Byeongchang Kim, Gary Geunbae Lee
JMLR
2002
115views more  JMLR 2002»
13 years 8 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
ICPR
2006
IEEE
14 years 9 months ago
Target Model Estimation using Particle Filters for Visual Servoing
In this paper, we present a novel method for model estimation for visual servoing. This method employs a particle filter algorithm to estimate the depth of the image features onli...
A. H. Abdul Hafez, C. V. Jawahar