Extending greedy feature selection algorithms to multiple solutions

DOI10.1007/S10618-020-00731-7MaRDI QIDQ2036770zbMATH OpenOpenAlexFDO

Authors Giorgos Borboudakis, Ioannis Tsamardinos

Publication date 30 June 2021

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10618-020-00731-7

zbMATH Keywords

feature selectionmultiple solutionsstepwise selectionmultiple feature selection

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• 10.1162/153244303322753616
• Feature selection when there are many influential features
• On the consistency of feature selection using greedy least squares regression
• scientific article; zbMATH DE number 1691504
• Novel randomized feature selection algorithms

Cites work

• scientific article; zbMATH DE number 1817585 (Why is no real title available?)
• scientific article; zbMATH DE number 708500 (Why is no real title available?)
• scientific article; zbMATH DE number 1104922 (Why is no real title available?)
• scientific article; zbMATH DE number 1962788 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3444596 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 3357756 (Why is no real title available?)
• A greedy feature selection algorithm for big data of high dimensionality
• A nondegenerate Vuong test
• Algorithms for discovery of multiple Markov boundaries
• Applied Linear Regression
• Conditional likelihood maximisation: a unifying framework for information theoretic feature selection
• Discrepancy risk model selection test theory for comparing possibly misspecified or nonnested models
• Empirical analysis of case-editing approaches for numeric prediction
• Estimating the dimension of a model
• Forward-backward selection with early dropping
• Graph-Based Algorithms for Boolean Function Manipulation
• Improving the variable ordering of OBDDs is NP-complete
• Incremental Construction of Minimal Acyclic Finite-State Automata
• LIBLINEAR: a library for large linear classification
• Likelihood Ratio Tests for Model Selection and Non-Nested Hypotheses
• Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
• Maximum Likelihood Estimation of Misspecified Models
• Minimisation of acyclic deterministic automata in linear time
• Model specification tests against non-nested alternatives
• Plane Answers to Complex Questions
• Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
• Several Tests for Model Specification in the Presence of Alternative Hypotheses
• The Hardness of Conditional Independence Testing and the Generalised Covariance Measure
• The performance of the likelihood ratio test when the model is incorrect
• Towards scalable and data efficient learning of Markov boundaries
• Wrappers for feature subset selection
• Zero-suppressed BDDs and their applications

Cited in

(1)

• Classifier-dependent feature selection via greedy methods

Describes a project that uses

Uses Software

• boot
• GeneralisedCovarianceMeasure
• MXM
• LIBLINEAR
• alr3

This page was built for publication: Extending greedy feature selection algorithms to multiple solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036770)