The pathwidth and treewidth of cographs
SIAM Journal on Discrete Mathematics
Machine Learning - Special issue on learning with probabilistic representations
Probabilities for a probabilistic network: a case study in oesophageal cancer
Artificial Intelligence in Medicine
Multi-dimensional classification with Bayesian networks
International Journal of Approximate Reasoning
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
Multi-label classification using conditional dependency networks
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Bayesian chain classifiers for multidimensional classification
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Environmental Modelling & Software
Artificial Intelligence in Medicine
Probabilistic multi-label classification with sparse feature learning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
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 polynomial 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.