A greedy feature selection algorithm for big data of high dimensionality
From MaRDI portal
Recommendations
- A semi-parallel framework for greedy information-theoretic feature selection
- scientific article; zbMATH DE number 6378115
- 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
Cites work
- scientific article; zbMATH DE number 5957250 (Why is no real title available?)
- scientific article; zbMATH DE number 1817585 (Why is no real title available?)
- scientific article; zbMATH DE number 3930202 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- scientific article; zbMATH DE number 733406 (Why is no real title available?)
- scientific article; zbMATH DE number 1104922 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 3444596 (Why is no real title available?)
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- 10.1162/153244303322753616
- A systematic comparison of methods for combining \(p\)-values from independent tests
- Adaptive Lasso and group-Lasso for functional Poisson regression
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Algorithms for discovery of multiple Markov boundaries
- Ancestral graph Markov models.
- Applied Linear Regression
- Applied logistic regression
- Best subset selection via a modern optimization lens
- Causation, prediction, and search
- Conditional likelihood maximisation: a unifying framework for information theoretic feature selection
- Estimating the dimension of a model
- Estimation for high-dimensional linear mixed-effects models using \(\ell_1\)-penalization
- Feature subset selection for logistic regression via mixed integer optimization
- Forward-backward selection with early dropping
- High-dimensional graphs and variable selection with the Lasso
- Least angle regression. (With discussion)
- 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
- MLlib: machine learning in Apache Spark
- Massively parallel feature selection: an approach based on variance preservation
- Maximum Likelihood Estimation of Misspecified Models
- Minimization of functions having Lipschitz continuous first partial derivatives
- On a class of incomplete gamma functions with applications
- Regression modeling strategies. With applications to linear models, logistic regression and survival analysis
- The Group Lasso for Logistic Regression
- The performance of the likelihood ratio test when the model is incorrect
- The synthesis of regression slopes in meta-analysis
- Towards scalable and data efficient learning of Markov boundaries
- alr3
Cited in
(9)- Extending greedy feature selection algorithms to multiple solutions
- Feature selection based on the best-path algorithm in high dimensional graphical models
- Hadoop neural network for parallel and distributed feature selection
- Rank-Based Greedy Model Averaging for High-Dimensional Survival Data
- Massively parallel feature selection: an approach based on variance preservation
- Parallelizing feature selection
- Forward-backward selection with early dropping
- scientific article; zbMATH DE number 6378115 (Why is no real title available?)
- A semi-parallel framework for greedy information-theoretic feature selection
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)
