2914 search results - page 137 / 583 » Learning and Inference with Constraints |
128
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
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...
165
click to vote
JMLR
2010
14 years 10 months ago
2010
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...
121
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
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 ...
127
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
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 ...
145
Voted
COLT
1991
Springer
15 years 6 months ago
1991
Springer
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}....