Gene selection algorithms for microarray data based on least squares support vector machine
<p>Abstract</p> <p>Background</p> <p>In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary to conduct the discriminant analysis with all the genes. Hence, ge...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2006-02-01
|
| Series: | BMC Bioinformatics |
| Online Access: | http://www.biomedcentral.com/1471-2105/7/95 |
| _version_ | 1828814270728503296 |
|---|---|
| author | Suganthan PN Tang E Ke Yao Xin |
| author_facet | Suganthan PN Tang E Ke Yao Xin |
| author_sort | Suganthan PN |
| collection | DOAJ |
| description | <p>Abstract</p> <p>Background</p> <p>In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary to conduct the discriminant analysis with all the genes. Hence, gene selection is usually performed to select important genes.</p> <p>Results</p> <p>A gene selection method searches for an optimal or near optimal subset of genes with respect to a given evaluation criterion. In this paper, we propose a new evaluation criterion, named the leave-one-out calculation (LOOC, A list of abbreviations appears just above the list of references) measure. A gene selection method, named leave-one-out calculation sequential forward selection (LOOCSFS) algorithm, is then presented by combining the LOOC measure with the sequential forward selection scheme. Further, a novel gene selection algorithm, the gradient-based leave-one-out gene selection (GLGS) algorithm, is also proposed. Both of the gene selection algorithms originate from an efficient and exact calculation of the leave-one-out cross-validation error of the least squares support vector machine (LS-SVM). The proposed approaches are applied to two microarray datasets and compared to other well-known gene selection methods using codes available from the second author.</p> <p>Conclusion</p> <p>The proposed gene selection approaches can provide gene subsets leading to more accurate classification results, while their computational complexity is comparable to the existing methods. The GLGS algorithm can also better scale to datasets with a very large number of genes.</p> |
| first_indexed | 2024-12-12T10:19:16Z |
| format | Article |
| id | doaj.art-c11143e9cdbb4f0f891324019a65743d |
| institution | Directory Open Access Journal |
| issn | 1471-2105 |
| language | English |
| last_indexed | 2024-12-12T10:19:16Z |
| publishDate | 2006-02-01 |
| publisher | BMC |
| record_format | Article |
| series | BMC Bioinformatics |
| spelling | doaj.art-c11143e9cdbb4f0f891324019a65743d2022-12-22T00:27:35ZengBMCBMC Bioinformatics1471-21052006-02-01719510.1186/1471-2105-7-95Gene selection algorithms for microarray data based on least squares support vector machineSuganthan PNTang E KeYao Xin<p>Abstract</p> <p>Background</p> <p>In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary to conduct the discriminant analysis with all the genes. Hence, gene selection is usually performed to select important genes.</p> <p>Results</p> <p>A gene selection method searches for an optimal or near optimal subset of genes with respect to a given evaluation criterion. In this paper, we propose a new evaluation criterion, named the leave-one-out calculation (LOOC, A list of abbreviations appears just above the list of references) measure. A gene selection method, named leave-one-out calculation sequential forward selection (LOOCSFS) algorithm, is then presented by combining the LOOC measure with the sequential forward selection scheme. Further, a novel gene selection algorithm, the gradient-based leave-one-out gene selection (GLGS) algorithm, is also proposed. Both of the gene selection algorithms originate from an efficient and exact calculation of the leave-one-out cross-validation error of the least squares support vector machine (LS-SVM). The proposed approaches are applied to two microarray datasets and compared to other well-known gene selection methods using codes available from the second author.</p> <p>Conclusion</p> <p>The proposed gene selection approaches can provide gene subsets leading to more accurate classification results, while their computational complexity is comparable to the existing methods. The GLGS algorithm can also better scale to datasets with a very large number of genes.</p>http://www.biomedcentral.com/1471-2105/7/95 |
| spellingShingle | Suganthan PN Tang E Ke Yao Xin Gene selection algorithms for microarray data based on least squares support vector machine BMC Bioinformatics |
| title | Gene selection algorithms for microarray data based on least squares support vector machine |
| title_full | Gene selection algorithms for microarray data based on least squares support vector machine |
| title_fullStr | Gene selection algorithms for microarray data based on least squares support vector machine |
| title_full_unstemmed | Gene selection algorithms for microarray data based on least squares support vector machine |
| title_short | Gene selection algorithms for microarray data based on least squares support vector machine |
| title_sort | gene selection algorithms for microarray data based on least squares support vector machine |
| url | http://www.biomedcentral.com/1471-2105/7/95 |
| work_keys_str_mv | AT suganthanpn geneselectionalgorithmsformicroarraydatabasedonleastsquaressupportvectormachine AT tangeke geneselectionalgorithmsformicroarraydatabasedonleastsquaressupportvectormachine AT yaoxin geneselectionalgorithmsformicroarraydatabasedonleastsquaressupportvectormachine |