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.
|Titolo:||An Ensemble Greedy Algorithm for Feature Selection in Cancer Genomics|
|Data di pubblicazione:||2011|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|