Network-based support vector machine for classification of microarray samples
The importance of network-based approach to identifying biological markers for diagnostic classification and prognostic assessment in the context of microarray data has been increasingly recognized. To our knowledge, there have been few, if any, statistical tools that explicitly incorporate the prio...
Gespeichert in:
Veröffentlicht in: | BMC bioinformatics 2009-01, Vol.10 Suppl 1 (S1), p.S21-S21, Article S21 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The importance of network-based approach to identifying biological markers for diagnostic classification and prognostic assessment in the context of microarray data has been increasingly recognized. To our knowledge, there have been few, if any, statistical tools that explicitly incorporate the prior information of gene networks into classifier building. The main idea of this paper is to take full advantage of the biological observation that neighboring genes in a network tend to function together in biological processes and to embed this information into a formal statistical framework.
We propose a network-based support vector machine for binary classification problems by constructing a penalty term from the Finfinity-norm being applied to pairwise gene neighbors with the hope to improve predictive performance and gene selection. Simulation studies in both low- and high-dimensional data settings as well as two real microarray applications indicate that the proposed method is able to identify more clinically relevant genes while maintaining a sparse model with either similar or higher prediction accuracy compared with the standard and the L1 penalized support vector machines.
The proposed network-based support vector machine has the potential to be a practically useful classification tool for microarrays and other high-dimensional data. |
---|---|
ISSN: | 1471-2105 1471-2105 |
DOI: | 10.1186/1471-2105-10-S1-S21 |