Can high-order dependencies improve mutual information based feature selection?

DOI10.1016/j.patcog.2015.11.007zbMath1412.68194OpenAlexW2177148767MaRDI QIDQ2416962

Yanyan Li

Publication date: 27 May 2019

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2015.11.007

zbMATH Keywords

mutual informationfeature selectionhigh-order dependency

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

On Relevant Features Selection Based on Information Theory ⋮ Cost-constrained group feature selection using information theory ⋮ Squared error-based shrinkage estimators of discrete probabilities and their application to variable selection ⋮ Unnamed Item ⋮ Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data ⋮ Efficient feature selection using shrinkage estimators

Cites Work

• Bayesian network classifiers
• Not so naive Bayes: Aggregating one-dependence estimators
• 10.1162/153244303322753616
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Can high-order dependencies improve mutual information based feature selection?