Sciweavers

2914 search results - page 137 / 583
» Learning and Inference with Constraints
Sort
View
ECAI
2008
Springer
14 years 1 days ago
An Analysis of Bayesian Network Model-Approximation Techniques
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...
Adamo Santana, Gregory M. Provan
JMLR
2010
163views more  JMLR 2010»
13 years 5 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
ICML
2007
IEEE
14 years 11 months ago
Spectral clustering and transductive learning with multiple views
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
Dengyong Zhou, Christopher J. C. Burges
COLT
2006
Springer
14 years 2 months ago
Learning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
François Denis, Yann Esposito, Amaury Habra...
COLT
1991
Springer
14 years 1 months ago
Learning Probabilistic Read-Once Formulas on Product Distributions
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
Robert E. Schapire