Feature selection for Bayesian network classifiers using the MDL-FS score
From MaRDI portal
Publication:990984
DOI10.1016/j.ijar.2010.02.001zbMath1205.68286OpenAlexW2013734290MaRDI QIDQ990984
Marco A. Wiering, Madalina M. Drugan
Publication date: 2 September 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/157802456/Feature_selection_for_Bayesian_network_classifiers_using_the_MDL_FS_score.pdf
minimum description lengthfeature subset selectionselective Bayesian classifierstree augumented networks
Related Items (5)
Bayesian network classifiers ⋮ Determination of Variables for a Bayesian Network and the Most Precious One ⋮ Learning Bayesian network classifiers by risk minimization ⋮ Multi-dimensional classification with Bayesian networks ⋮ Discrete Bayesian Network Classifiers
Cites Work
- A Mathematical Theory of Communication
- Fast algorithms for robust classification with Bayesian nets
- A unified framework for semi-supervised dimensionality reduction
- Bayesian classifiers based on kernel density estimation: flexible classifiers
- Towards scalable and data efficient learning of Markov boundaries
- Boosted Bayesian network classifiers
- Feature selection with dynamic mutual information
- Selection of relevant features and examples in machine learning
- Wrappers for feature subset selection
- Modeling by shortest data description
- On the optimality of the simple Bayesian classifier under zero-one loss
- Bayesian network classifiers
- Class noise vs. attribute noise: A quantitative study of their impacts
- Invariant optimal feature selection: A distance discriminant and feature ranking based solution
- Discriminative vs. Generative Learning of Bayesian Network Classifiers
- BayesRule: A Markov-Blanket based procedure for extracting a set of probabilistic rules from Bayesian classifiers
- Model Selection and the Principle of Minimum Description Length
- Strong optimality of the normalized ML models as universal codes and information in data
- 10.1162/153244303322753616
- Feature Selection for Classificatory Analysis Based on Information-theoretic Criteria
- Computational Methods of Feature Selection
- Approximating discrete probability distributions with dependence trees
- Feature subset selection by Bayesian networks: A comparison with genetic and sequential algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Feature selection for Bayesian network classifiers using the MDL-FS score
