Many regression algorithms, one unified model: A review
Open accessThe DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482 · cited 2×
“Several algorithms for finding solutions are described in (Tibshirani, 1996; Schmidt, 2005).”
MethodMaximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444 · cited 2×
“It is performed by fitting a Gaussian Mixture Model ( gmm ) to the data with the Expectation-Maximization ( em ) (Dempster et al., 1977) algorithm. k -means clustering is commonly used to provide a first initialization of the centers of the Gaussians.”
MethodThe Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066 · cited 1×
“Before continuing, we want to draw explicit attention to the difference between the model used in this section – the linear model in (1) – and the al-gorithm used to determine the model parameters of the model – the computations in (11).”
MethodClassification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570 · cited 3×
“For further reading, we provide references to other tutorials and books, including the work of Smola and Sch¨olkopf (2004), Bishop et al. (2006), Williams and Rasmussen (2006), and Schmidhuber (2014).”
MethodNeural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538 · cited 3×
“The model is easily extended to have multiple output nodes (Bishop, 1995).”
BackgroundInfluentialAdvances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387 · cited 7×
“For further reading, we provide references to other tutorials and books, including the work of Smola and Sch¨olkopf (2004), Bishop et al. (2006), Williams and Rasmussen (2006), and Schmidhuber (2014).”
BackgroundMethodInfluentialExtreme learning machine: Theory and applications
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · Neurocomputing · doi:10.1016/j.neucom.2005.12.126 · Cited by 13,285 · cited 6×
“(Gijsberts and Metta, 2012) CART Regression Trees (Breiman et al., 1984) elm Extreme Learning Machine (Huang et al., 2006b) BProp Backpropagation (Werbos, 1974) Table 1: List of algorithms presented in this article. understand model highlights relationships between algorithms; a key to acquiring…”
BackgroundMethodInfluential
Cited by
A tutorial on task-parameterized movement learning and retrieval
Calinon, S. (2016) · Intelligent Service Robotics · doi:10.1007/s11370-015-0187-9 · Cited by 422
Lee, J. H., Shin, J., & Realff, M. J. (2018) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2017.10.008 · Cited by 387
Metadata
- Authors
- Stulp, F., & Sigaud, O.
- Venue
- Neural Networks
- Publisher
- Elsevier BV
- Published
- 2015-09
- Volume
- 69
- Pages
- 60-79
- ISSN
- 0893-6080 (ISSN-L)
- OpenAlex
- W607853484
- Cited by
- 220
- References
- 72
- FWCI
- 12.51
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.