Evidential reasoning using stochastic simulation of causal models
Artificial Intelligence
On the limited memory BFGS method for large scale optimization
Mathematical Programming: Series A and B
Theory refinement on Bayesian networks
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Machine Learning - Special issue on learning with probabilistic representations
Construction of Large-Scale Bayesian Networks by Local to Global Search
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Dependency networks for inference, collaborative filtering, and data visualization
The Journal of Machine Learning Research
Improvement of Naïve Bayes Collaborative Filtering Using Interval Estimation
WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
Time and sample efficient discovery of Markov blankets and direct causal relations
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Relational Dependency Networks
The Journal of Machine Learning Research
Operations for learning with graphical models
Journal of Artificial Intelligence Research
ItemRank: a random-walk based scoring algorithm for recommender engines
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Scalable statistical learning: a modular Bayesian/Markov network approach
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Collaborative filtering with the simple Bayesian classifier
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Learning Bayesian networks with local structure
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Kernel-Based Hybrid Random Fields for Nonparametric Density Estimation
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
ANNPR'12 Proceedings of the 5th INNS IAPR TC 3 GIRPR conference on Artificial Neural Networks in Pattern Recognition
| Hi-index | 0.00 |
This paper introduces hybrid random fields, which are a class of probabilistic graphical models aimed at allowing for efficient structure learning in high-dimensional domains. Hybrid random fields, along with the learning algorithm we develop for them, are especially useful as a pseudo-likelihood estimation technique (rather than a technique for estimating strict joint probability distributions). In order to assess the generality of the proposed model, we prove that the class of pseudo-likelihood distributions representable by hybrid random fields strictly includes the class of joint probability distributions representable by Bayesian networks. Once we establish this result, we develop a scalable algorithm for learning the structure of hybrid random fields, which we call 'Markov Blanket Merging'. On the one hand, we characterize some complexity properties of Markov Blanket Merging both from a theoretical and from the experimental point of view, using a series of synthetic benchmarks. On the other hand, we evaluate the accuracy of hybrid random fields (as learned via Markov Blanket Merging) by comparing them to various alternative statistical models in a number of pattern classification and link-prediction applications. As the results show, learning hybrid random fields by the Markov Blanket Merging algorithm not only reduces significantly the computational cost of structure learning with respect to several considered alternatives, but it also leads to models that are highly accurate as compared to the alternative ones.