Multi-dimensional Bayesian network classifiers

Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006

Volumn , Issue , 2006, Pages 107-114

  Van Der Gaag, Linda C ^a   De Waal, Peter R ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORK CLASSIFIERS; LEARNING PROBLEM; MODELLING CAPABILITIES; MULTIDIMENSIONALITY; MULTIPLE FEATURES; NAIVE BAYESIAN; SOLUTION ALGORITHMS;

POLYNOMIALS;

BAYESIAN NETWORKS;

EID: 38049130047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. H.L. Bodlaender, F. van den Eijkhof and L.C. van der Gaag. (2002). On the complexity of the MPA problem in probabilistic networks. In: Proceedings of the 15th European Conference on Artificial Intelligence, IOS Press, pages 675-679.
2. V.K. Chow and C.N. Liu. (1968). Approximat ing discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14: 462-467.
3. Y.J. Chu and T.H. Liu. (1965). On the shortest arborescence of a directed graph. Scientia Sinica, 14: 1396-1400.
4. T.M. Cover and J.A. Thomas. (1991). Elements of Information Theory, Wiley.
5. J. Edmonds. (1967). Optimum branchings. Journal of Research of the National Bureau of Standards, 71B: 233-240.
6. N. Friedman, D. Geiger and M. Goldszmidt. (1997). Bayesian network classifiers. Machine Learning, 29: 131-163.
7. E.J. Keogh and M.J. Pazzani. (1999). Learning augmented Bayesian classifiers: a comparison of distribution-based and classification-based approaches. In: Proceedings of the 7th International Workshop on AI and Statistics, pages 225-230.
8. R. Kohavi and G.H. John. (1997). Wrappers for feature subset selection. Artificial Intelligence, 97: 273-324.
9. J.B. Kruskal. (1956). On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society, 7: 48-50.
10. P. Langley, W. Iba and K. Thompson. (1992). An analysis of Bayesian classifiers. In: Proceedings of the 10th Conference on Artificial Intelligence, pages 223-228.
11. P.J.F. Lucas. (2004). Restricted Bayesian network structure learning. In: Advances in Bayesian Net works. Studies in Fuzziness and Soft Computing, vol. 146, SpringerVerlag, pages 217-232.
12. J. Park. (2002). MAP complexity results and approximation methods. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelli gence, Morgan Kaufmann, pages 388-396.
13. M. Sahami. (1996). Learning limited dependence Bayesian classifiers. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, AAAI Press, pages 335-338.
14. I. Tsamardinos and C.F. Aliferis. (2003). Towards principled feature selection: relevance, filters, and wrappers. In: Proceedings of the 9th International Workshop on Artificial Intelligence and Statistics.
15. L.C. van der Gaag, S. Renooij, C.L.M. Witteman, B.M.P. Aleman and B.G. Taal. (2002). Probabil ities for a probabilistic network: a case study in oesophageal cancer. Artificial Intelligence in Medicine, 25: 123-148.