On searching for optimal classifiers among Bayesian networks

Robert G. Cowell
Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics, PMLR R3:71-76, 2001.

Abstract

There is much interest in constructing from datasets Bayesian networks which are efficient, or even optimal, for classification purposes. Most search strategies usually discriminate between networks by comparing their marginal likelihood score, but recently it has been suggested that search strategies for classifiers should instead select among models using alternative scores. This paper contributes to this discussion by presenting the results of simulations on the sets of all directed acyclic graphs on four and five nodes. Our results add evidence to earlier indications that the marginal likelihood is likely to be a poor criterion to use for classifier selection.

Cite this Paper

BibTeX
@InProceedings{pmlr-vR3-cowell01a, title = {On searching for optimal classifiers among Bayesian networks}, author = {Cowell, Robert G.}, booktitle = {Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics}, pages = {71--76}, year = {2001}, editor = {Richardson, Thomas S. and Jaakkola, Tommi S.}, volume = {R3}, series = {Proceedings of Machine Learning Research}, month = {04--07 Jan}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/r3/cowell01a/cowell01a.pdf}, url = {https://proceedings.mlr.press/r3/cowell01a.html}, abstract = {There is much interest in constructing from datasets Bayesian networks which are efficient, or even optimal, for classification purposes. Most search strategies usually discriminate between networks by comparing their marginal likelihood score, but recently it has been suggested that search strategies for classifiers should instead select among models using alternative scores. This paper contributes to this discussion by presenting the results of simulations on the sets of all directed acyclic graphs on four and five nodes. Our results add evidence to earlier indications that the marginal likelihood is likely to be a poor criterion to use for classifier selection.}, note = {Reissued by PMLR on 31 March 2021.} }
Endnote
%0 Conference Paper %T On searching for optimal classifiers among Bayesian networks %A Robert G. Cowell %B Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 2001 %E Thomas S. Richardson %E Tommi S. Jaakkola %F pmlr-vR3-cowell01a %I PMLR %P 71--76 %U https://proceedings.mlr.press/r3/cowell01a.html %V R3 %X There is much interest in constructing from datasets Bayesian networks which are efficient, or even optimal, for classification purposes. Most search strategies usually discriminate between networks by comparing their marginal likelihood score, but recently it has been suggested that search strategies for classifiers should instead select among models using alternative scores. This paper contributes to this discussion by presenting the results of simulations on the sets of all directed acyclic graphs on four and five nodes. Our results add evidence to earlier indications that the marginal likelihood is likely to be a poor criterion to use for classifier selection. %Z Reissued by PMLR on 31 March 2021.
APA
Cowell, R.G.. (2001). On searching for optimal classifiers among Bayesian networks. Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research R3:71-76 Available from https://proceedings.mlr.press/r3/cowell01a.html. Reissued by PMLR on 31 March 2021.

Related Material