When learning naive Bayesian classifiers preserves monotonicity
DOI10.1007/978-3-642-22152-1_36zbMATH Open1341.68166OpenAlexW108770298MaRDI QIDQ3011963FDOQ3011963
Authors: Barbara F. I. Pieters, A. J. Feelders, Linda C. van der Gaag
Publication date: 29 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22152-1_36
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Wrappers for feature subset selection
- Bayesian Networks and Decision Graphs
- Bayesian network classifiers
- On the optimality of the simple Bayesian classifier under zero-one loss
- Learning Bayesian network parameters under order constraints
- Fundamental concepts of qualitative probabilistic networks
- A linear fit gets the correct monotonicity directions
Cited In (4)
This page was built for publication: When learning naive Bayesian classifiers preserves monotonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011963)