Sciweavers

141 search results - page 11 / 29
» Approximate algorithms for credal networks with binary varia...
Sort
View
JMLR
2010
144views more  JMLR 2010»
13 years 3 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
13 years 8 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
UAI
2003
13 years 10 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 9 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
AAAI
2008
13 years 11 months ago
A General Framework for Generating Multivariate Explanations in Bayesian Networks
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
Changhe Yuan, Tsai-Ching Lu