A greedy feature selection algorithm for big data of high dimensionality
DOI10.1007/S10994-018-5748-7zbMATH Open1483.68351OpenAlexW2887961823WikidataQ64112700 ScholiaQ64112700MaRDI QIDQ669273FDOQ669273
Authors: Ioannis Tsamardinos, Giorgos Borboudakis, Pavlos Katsogridakis, Polyvios Pratikakis, Vassilis Christophides 
Publication date: 15 March 2019
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-018-5748-7
Recommendations
- A semi-parallel framework for greedy information-theoretic feature selection
- scientific article
- Forward-backward selection with early dropping
- Massively parallel feature selection: an approach based on variance preservation
- Evolutionary feature selection for big data classification: a MapReduce approach
Computational aspects of data analysis and big data (68T09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- alr3
- Applied Linear Regression
- Causation, prediction, and search
- MLlib: machine learning in Apache Spark
- Title not available (Why is that?)
- Estimating the dimension of a model
- Least angle regression. (With discussion)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 10.1162/153244303322753616
- Title not available (Why is that?)
- Maximum Likelihood Estimation of Misspecified Models
- Likelihood Ratio Tests for Model Selection and Non-Nested Hypotheses
- High-dimensional graphs and variable selection with the Lasso
- Best subset selection via a modern optimization lens
- Title not available (Why is that?)
- The Group Lasso for Logistic Regression
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for discovery of multiple Markov boundaries
- Regression modeling strategies. With applications to linear models, logistic regression and survival analysis
- Ancestral graph Markov models.
- Estimation for high-dimensional linear mixed-effects models using \(\ell_1\)-penalization
- Title not available (Why is that?)
- Title not available (Why is that?)
- The performance of the likelihood ratio test when the model is incorrect
- Title not available (Why is that?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- Title not available (Why is that?)
- The synthesis of regression slopes in meta-analysis
- Feature subset selection for logistic regression via mixed integer optimization
- Applied logistic regression
- Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
- Massively parallel feature selection: an approach based on variance preservation
- On a class of incomplete gamma functions with applications
- A systematic comparison of methods for combining \(p\)-values from independent tests
- Towards scalable and data efficient learning of Markov boundaries
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Adaptive Lasso and group-Lasso for functional Poisson regression
- Forward-backward selection with early dropping
- Conditional likelihood maximisation: a unifying framework for information theoretic feature selection
Cited In (9)
- A semi-parallel framework for greedy information-theoretic feature selection
- Rank-Based Greedy Model Averaging for High-Dimensional Survival Data
- Forward-backward selection with early dropping
- Title not available (Why is that?)
- Parallelizing feature selection
- Extending greedy feature selection algorithms to multiple solutions
- Hadoop neural network for parallel and distributed feature selection
- Massively parallel feature selection: an approach based on variance preservation
- Feature selection based on the best-path algorithm in high dimensional graphical models
Uses Software
This page was built for publication: A greedy feature selection algorithm for big data of high dimensionality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669273)
