Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On the hardness of approximate reasoning
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Maximum likelihood bounded tree-width Markov networks
Artificial Intelligence
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Learning with mixtures of trees
The Journal of Machine Learning Research
MAFIA: A Maximal Frequent Itemset Algorithm
IEEE Transactions on Knowledge and Data Engineering
Naive Bayes models for probability estimation
ICML '05 Proceedings of the 22nd international conference on Machine learning
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
Learning probabilistic decision graphs
International Journal of Approximate Reasoning
Goal oriented symbolic propagation in Bayesian networks
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Constructing free-energy approximations and generalized belief propagation algorithms
IEEE Transactions on Information Theory
Guest editors' introduction: special issue of selected papers from ECML PKDD 2009
Data Mining and Knowledge Discovery
Guest editors' introduction: Special Issue from ECML PKDD 2009
Machine Learning
Learning Multi-linear Representations of Distributions for Efficient Inference
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
| Hi-index | 0.00 |
We examine the class of multi-linear representations (MLR) for expressing probability distributions over discrete variables. Recently, MLR have been considered as intermediate representations that facilitate inference in distributions represented as graphical models.We show that MLR is an expressive representation of discrete distributions and can be used to concisely represent classes of distributions which have exponential size in other commonly used representations, while supporting probabilistic inference in time linear in the size of the representation. Our key contribution is presenting techniques for learning bounded-size distributions represented using MLR, which support efficient probabilistic inference. We demonstrate experimentally that the MLR representations we learn support accurate and very efficient inference.