The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Gene selection in cancer classification using sparse logistic regression with Bayesian regularization
Abstract
Motivation: Gene selection algorithms for cancer classification, based on the expression of a small number of biomarker genes, have been the subject of considerable research in recent years. Shevade and Keerthi propose a gene selection algorithm based on sparse logistic regression (SLogReg) incorporating a Laplace prior to promote sparsity in the model parameters, and provide a simple but efficient training procedure. The degree of sparsity obtained is determined by the value of a regularization parameter, which must be carefully tuned in order to optimize performance. This normally involves a model selection stage, based on a computationally intensive search for the minimizer of the cross-validation error. In this paper, we demonstrate that a simple Bayesian approach can be taken to eliminate this regularization parameter entirely, by integrating it out analytically using an uninformative Jeffrey's prior. The improved algorithm (BLogReg) is then typically two or three orders of magnitude faster than the original algorithm, as there is no longer a need for a model selection step. The BLogReg algorithm is also free from selection bias in performance estimation, a common pitfall in the application of machine learning algorithms in cancer classification. Results: The SLogReg, BLogReg and Relevance Vector Machine (RVM) gene selection algorithms are evaluated over the well-studied colon cancer and leukaemia benchmark datasets. The leave-one-out estimates of the probability of test error and cross-entropy of the BLogReg and SLogReg algorithms are very similar, however the BlogReg algorithm is found to be considerably faster than the original SLogReg algorithm. Using nested cross-validation to avoid selection bias, performance estimation for SLogReg on the leukaemia dataset takes almost 48 h, whereas the corresponding result for BLogReg is obtained in only 1 min 24 s, making BLogReg by far the more practical algorithm. BLogReg also demonstrates better estimates of conditional probability than the RVM, which are of great importance in medical applications, with similar computational expense. Availability: A MATLAB implementation of the sparse logistic regression algorithm with Bayesian regularization (BLogReg) is available from Contact: gcc@cmp.uea.ac.uk
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
A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
Kohavi, R. (1995) · Zenodo · doi:10.5281/zenodo.19712698 · Cited by 10,909
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
A practical Bayesian framework for backpropagation networks
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.448 · Cited by 2,917
Predictive automatic relevance determination by expectation propagation
Qi, Y. (., Minka, T. P., Picard, R. W., & Ghahramani, Z. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015418 · Cited by 110
Research works printed but not linked: 27
- Alon, 1999, Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays, Proc. Natl Acad. Sci. USA, 96, 6745, 10.1073/pnas.96.12.6745 · DOI · Paper page
- Ambroise, 2002, Selection bias in gene extraction on the basis of microarray gene-expression data, Proc. Natl Acad. Sci. USA, 99, 6562, 10.1073/pnas.102102699 · DOI · Paper page
- Berger, 1985, Statistical Decision Theory and Bayesian Analysis, 10.1007/978-1-4757-4286-2 · DOI · Paper page
- Buntine, 1991, Bayesian back-propagation, Complex Syst., 5, 603
- Cawley, 2006, Discriminative detection of regulatory elements
- Cawley, 2006, Sparse multinomial logistic regression via Bayesian regularisation using a Laplace prior
- Chu, 2005, Biomarker discovery in microarray gene expression data with Gaussian processes, Bioinformatics, 21, 3385, 10.1093/bioinformatics/bti526 · DOI
- Faul, 2002, Analysis of sparse Bayesian learning, 383
- Faul, 2003, Fast marginal likelihood maximisation for sparse Bayesian models
- Figueiredo, 2003, Adaptive sparseness for supervised learning, IEEE Trans. Pattern Anal. Mach. Intell., 25, 1150, 10.1109/TPAMI.2003.1227989 · DOI · Paper page
- Golub, 1999, Molecular classification of cancer: class discovery and class prediction by gene expression monitoring, Science, 286, 531, 10.1126/science.286.5439.531 · DOI · Paper page
- Gradshteyn, 1994, Table of Integrals, Series and Products
- Jeffreys, 1961, Theory of Probability. Oxford Classic Texts in the Physical Sciences
- Lehrach, 2006, A regularized discriminative model for the prediction of peptide-peptide interactions, Bioinformatics, 22, 532, 10.1093/bioinformatics/bti804 · doi:10.1093/bioinformatics/bti804
- Li, 2002, Bayesian automatic relevance determination algorithms for classifying gene expression data, Bioinformatics, 18, 1332, 10.1093/bioinformatics/18.10.1332 · DOI · Paper page
- Luntz, 1969, On estimation of characters obtained in statistical procedure of reognition (in Russian), Technicheskaya Kibernetica, 3
- MacKay, 1992, Bayesian interpolation, Neural Comput., 4, 415, 10.1162/neco.1992.4.3.415 · DOI · Paper page
- MacKay, 1992, The evidence framework applied to classification networks, Neural Comput., 4, 720, 10.1162/neco.1992.4.5.720 · DOI · Paper page
- MacKay, 1994, Hyperparameters: optimise or integrate out?
- MacKay, 1999, Comparison of approximate methods for handling hyperparameters, Neural Netw., 11, 1035
- Shevade, 2003, A simple and efficient algorithm for gene selection using sparse logistic regression, Bioinformatics, 19, 2246, 10.1093/bioinformatics/btg308 · DOI · Paper page
- Stone, 1974, Cross-validatory choice and assessment of statistical predictions, J. R. Stat. Soc. B, 36, 111, 10.1111/j.2517-6161.1974.tb00994.x · DOI · Paper page
- Tan, 2005, Simple decision rules for classifying human cancers from gene expression profiles, Bioinformatics, 21, 3896, 10.1093/bioinformatics/bti631 · DOI · Paper page
- Tikhonov, 1977, Solutions of Ill-Posed Problems
- Tipping, 2001, Sparse Bayesian learning and the relevance vector machine, J. Mach. Learn. Res., 1, 211
- Williams, 1996, Gaussian processes for regression, 514
- Williams, 1995, Bayesian regularization and pruning using a Laplace prior, Neural Comput., 7, 117, 10.1162/neco.1995.7.1.117 · DOI · Paper page
Cited by
Monroe, B. L., Colaresi, M. P., & Quinn, K. M. (2008) · Political Analysis · doi:10.1093/pan/mpn018 · Cited by 542
Hussain, M., Zhu, W., Zhang, W., & Abidi, S. M. R. (2018) · Computational Intelligence and Neuroscience · doi:10.1155/2018/6347186 · Cited by 382
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
Li, H.-D., Xu, Q.-S., & Liang, Y.-Z. (2012) · Analytica Chimica Acta · doi:10.1016/j.aca.2012.06.031 · Cited by 282
O'Dwyer, L., Lamberton, F., Bokde, A. L. W., Ewers, M., Faluyi, Y. O., Tanner, C., Mazoyer, B., O'Neill, D., Bartley, M., Collins, D. R., et al. (2012) · PLoS ONE · doi:10.1371/journal.pone.0032441 · Cited by 117
Metadata
- Authors
- Cawley, G. C., & Talbot, N. L. C.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-07-14
- Volume
- 22
- Issue
- 19
- Pages
- 2348-2355
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2144073719
- Cited by
- 242
- References
- 4
- FWCI
- 3.81
- Type
- journal article
- Language
- en
- Open access
- closed
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.