Inference and Learning in Multi-dimensional Bayesian Network Classifiers [chapter]

Peter R. de Waal, Linda C. van der Gaag
2007 Lecture Notes in Computer Science  
We describe the family of multi-dimensional Bayesian network classifiers which include one or more class variables and multiple feature variables. The family does not require that every feature variable is modelled as being dependent on every class variable, which results in better modelling capabilities than families of models with a single class variable. For the family of multidimensional classifiers, we address the complexity of the classification problem and show that it can be solved in
more » ... lynomial time for classifiers with a graphical structure of bounded treewidth over their feature variables and a restricted number of class variables. We further describe the learning problem for the subfamily of fully polytree-augmented multi-dimensional classifiers and show that its computational complexity is polynomial in the number of feature variables.
doi:10.1007/978-3-540-75256-1_45 fatcat:f6jp5ozco5h6dk3pvrmyui4jmy