Signature learning from gene expression consists into selecting a subset of molecular markers which best correlate with prognosis. It can be cast as a feature selection problem. Here we use as optimality criterion the separation between survival curves of clusters induced by the selected features. We address some important problems in this fields such as developing an unbiased search procedure and significance analysis of a set of generated signatures. We apply the proposed procedure to the selection of gene signatures for Non Small Lung Cancer prognosis by using a real data-set.
An algorithm for finding gene signatures supervised by survival time data
Pagnotta S M;Ceccarelli M
2011-01-01
Abstract
Signature learning from gene expression consists into selecting a subset of molecular markers which best correlate with prognosis. It can be cast as a feature selection problem. Here we use as optimality criterion the separation between survival curves of clusters induced by the selected features. We address some important problems in this fields such as developing an unbiased search procedure and significance analysis of a set of generated signatures. We apply the proposed procedure to the selection of gene signatures for Non Small Lung Cancer prognosis by using a real data-set.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.