Markov blanket approximation based on clustering

Authors:
Paweł Betliński
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland
Venue:
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Year:
2011

Citing 3
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
The max-min hill-climbing Bayesian network structure learning algorithm

Machine Learning
Learning Bayesian Networks

Learning Bayesian Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents new idea for Markov blanket approximation. It uses well known heuristic ordering of variables based on mutual information, but in another way then it was considered in previous works. Instead of using it as a simple help tool in a more complicated method most often based on statistical tests - presented here idea tries to rely without any further statistical tests only on the heuristic and its previously not considered interesting properties.