Signature learning from gene expression consists in selecting a subset of molecular markers which best correlate with prognosis. It can be cast as an optimization-based 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 Colon Cancer prognosis by using a real data-set.

An Ensemble Greedy Algorithm for Feature Selection in Cancer Genomics

PAGNOTTA S;MASSIMO PANCIONE;LUIGI CERULO;VITTORIO COLANTUONI;MICHELE CECCARELLI
2011-01-01

Abstract

Signature learning from gene expression consists in selecting a subset of molecular markers which best correlate with prognosis. It can be cast as an optimization-based 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 Colon Cancer prognosis by using a real data-set.
2011
978-1-4673-0247-0
File in questo prodotto:
File Dimensione Formato  
SKIMA2011.pdf

non disponibili

Licenza: Non specificato
Dimensione 174.48 kB
Formato Adobe PDF
174.48 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12070/13365
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact