Data complexity meta-features for regression problems
DOI10.1007/S10994-017-5681-1zbMATH Open1462.62392DBLPjournals/ml/LorenaMMCP18OpenAlexW2777539043WikidataQ62764519 ScholiaQ62764519MaRDI QIDQ142808FDOQ142808
Ricardo B. C. Prudêncio, Ivan G. Costa, Ana C. Lorena, Ivan G. Costa, Ricardo B. C. Prudêncio, Péricles B. C. de Miranda, Ana Carolina Lorena, Aron I. Maciel, Aron I. Maciel, Péricles B. C. De Miranda
Publication date: 21 December 2017
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-017-5681-1
Recommendations
- Efficient learning and feature selection in high-dimensional regression
- Model and feature selection in metrology data approximation
- Dimensionality reduction by feature clustering for regression problems
- Theoretical and computational difficulties of modern regression data analysis
- scientific article; zbMATH DE number 3872738
- Dimensionality Reduction, Regularization, and Generalization in Overparameterized Regressions
- Informational complexity criteria for regression models.
- scientific article; zbMATH DE number 1717318
Classification and discrimination; cluster analysis (statistical aspects) (62H30) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
Cited In (4)
Uses Software
This page was built for publication: Data complexity meta-features for regression problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q142808)