Prediction using step-wise L1, L2 regularization and feature selection for small data sets with large number of features
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Background: Machine learning methods are nowadays used for many biological prediction problems involving drugs, ligands or polypeptide segments of a protein. In order to build a prediction model a so called training data set of molecules with measured target properties is needed. For many such problems the size of the training data set is limited as measurements have to be performed in a wet lab. Furthermore, the considered problems are often complex, such that it is not clear which molecular descriptors (features) may be suitable to establish a strong correlation with the target property. In many applications all available descriptors are used. This can lead to difficult machine learning problems, when thousands of descriptors are considered and only few (e.g. below hundred) molecules are available for training. Results: The CoEPrA contest provides four data sets, which are typical for biological regression problems (few molecules in the training data set and thousands of descriptors). We applied the same two-step training procedure for all four regression tasks. In the first stage, we used optimized L1 regularization to select the most relevant features. Thus, the initial set of more than 6,000 features was reduced to about 50. In the second stage, we used only the selected features from the preceding stage applying a milder L2 regularization, which generally yielded further improvement of prediction performance. Our linear model employed a soft loss function which minimizes the influence of outliers. Conclusions: The proposed two-step method showed good results on all four CoEPrA regression tasks. Thus, it may be useful for many other biological prediction problems where for training only a small number of molecules are available, which are described by thousands of descriptors.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Ridge regression: Biased estimation for nonorthogonal problems
Hoerl, A. E., & Kennard, R. W. (1970) · Technometrics · doi:10.1080/00401706.1970.10488634 · Cited by 9,648
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470 · cited 1×
“This favorable property of L1 regularization suggested that it works like an oracle as discussed in some papers [14,15].”
BackgroundAmino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917 · cited 3×
“In this work, the simple Rprop algorithm [11] is used to approximate the optimal L1 regularized solution leading to good results.”
MethodInfluentialTrefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
Research works printed but not linked: 20
- Demir-Kavuk O, Riedesel H, Knapp EW: Exploring classification strategies with the CoEPrA 2006 contest. Bioinformatics 26(5):603–9. · DOI
- Tibshirani R: Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society Series B-Methodological 1996, 58(1):267–288. · DOI · Paper page
- Xu ZongBen, Z H, Wang Yao, Chang XiangYu, Yong Liang: L1/2 regularizer. SCIENCE CHINA 2010, 53(6):1159–1169.
- Andrew G, Gao J: Scalable training of L1-regularized log-linear models. ICML '™07 2007.
- Lee S, Lee H, Abbeel P, Ng A: Efficient L1 Regularized Logistic Regression. Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06) 2006.
- Goodman J: Exponential Priors for Maximum Entropy Models . Proceedings of HLTNAACL 2004 2003.
- Roth V: The generalized LASSO. IEEE Trans Neural Netw 2004, 15(1):16–28. 10.1109/TNN.2003.809398 · DOI · Paper page
- Perkins S, Theiler J: Online feature selection using grafting. In Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003. AAAI Press; 21–24.
- Fan JaLR: Variable selection via nonconcave penalized likelihood and its oracle properties. In Journal of the American Statistical Association. ASA; 2001:1348–1360.
- Atchley WR, Zhao J, Fernandes AD, Druke T: Solving the protein sequence metric problem. Proc Natl Acad Sci USA 2005, 102(18):6395–400. 10.1073/pnas.0408677102 · DOI · Paper page
- Georgiev AG: Interpretable numerical descriptors of amino acid space. J Comput Biol 2009, 16(5):703–23. 10.1089/cmb.2008.0173 · DOI · Paper page
- Venkatarajan MS, Braun W: New quantitative descriptors of amino acids based on multidimensional scaling of a large number of physicalâ€"chemical properties. Journal of Molecular Modeling 2001, 7(12):445–453. 10.1007/s00894-001-0058-5 · doi:10.1007/s00894-001-0058-5
- Pearson K: On lines and planes of closest fit to systems of points in space. Philosophical Magazine 1901, 2(6):559–572. · DOI · Paper page
- Altschul SF, et al.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 1997, 25(17):3389–402. 10.1093/nar/25.17.3389 · DOI · Paper page
- Kawashima S, Ogata H, Kanehisa M: AAindex: Amino Acid Index Database. Nucleic Acids Res 1999, 27(1):368–369. 10.1093/nar/27.1.368 · DOI · Paper page
- Shlens J: A Tutorial on Principal Component Analysis. 2005.
- Hansen L, et al.: Controlling feature selection in random forests of decision trees using a genetic algorithm: classification of class I MHC peptides. Comb Chem High Throughput Screen 2009, 12(5):514–9. 10.2174/138620709788488984 · doi:10.2174/138620709788488984
- Patil D, et al.: Feature selection and classification employing hybrid ant colony optimization/random forest methodology. Comb Chem High Throughput Screen 2009, 12(5):507–13. 10.2174/138620709788488993 · doi:10.2174/138620709788488993
- Riedesel H, Kolbeck B, Schmetzer O, Knapp EW: Peptide binding at class I major histocompatibility complex scored with linear functions and support vector machines. Genome Inform 2004, 15(1):198–212.
- Spearman C: The proof and measurement of association between two things. By C. Spearman, 1904. Am J Psychol 1987, 100(3–4):441–71. · DOI · Paper page
Cited by
Interpreting Black-Box Models: A Review on Explainable Artificial Intelligence
Hassija, V., Chamola, V., Mahapatra, A., Singal, A., Goel, D., Huang, K., Scardapane, S., Spinelli, I., Mahmud, M., & Hussain, A. (2024) · Cognitive Computation · doi:10.1007/s12559-023-10179-8 · Cited by 2,495
“L1 and L2 regularisation provide a novel solution in handling the overfitting and feature selection for such cases [120, 121].”
BackgroundSambasivam, G., & Opiyo, G. D. (2021) · Egyptian Informatics Journal · doi:10.1016/j.eij.2020.02.007 · Cited by 338
Nicholls, H. L., John, C. R., Watson, D. S., Munroe, P. B., Barnes, M. R., & Cabrera, C. P. (2020) · Frontiers in Genetics · doi:10.3389/fgene.2020.00350 · Cited by 155
Parallel Implementation on FPGA of Support Vector Machines Using Stochastic Gradient Descent
Lopes, F. F., Ferreira, J. C., & Fernandes, M. A. C. (2019) · Electronics · doi:10.3390/electronics8060631 · Cited by 29
“For Equations (4) and (5), the loss function chosen was Hinge-Loss and the regularization given by the l1 method [14].”
MethodEvolutionary sparse learning for phylogenomics
Kumar, S., & Sharma, S. (2021) · Molecular Biology and Evolution · doi:10.1093/molbev/msab227 · Cited by 22
Metadata
- Authors
- Demir-Kavuk, O., Kamada, M., Akutsu, T., & Knapp, E.-W.
- Venue
- BMC Bioinformatics
- Published
- 2011-10-25
- Volume
- 12
- Issue
- 1
- Pages
- 412-412
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W1999907667
- Cited by
- 133
- References
- 8
- FWCI
- 1.50
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Prediction using step-wise L1, L2 regularization and feature selection for small data sets with large number of features. https://app.cochat.ai/papers/10.1186/1471-2105-12-412
- The paper
- Demir-Kavuk, O., Kamada, M., Akutsu, T., & Knapp, E.-W. (2011). Prediction using step-wise L1, L2 regularization and feature selection for small data sets with large number of features. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-12-412
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.