AHMED DEBIT

We designed a score allowing to improve the computational time of the whole BSD pipeline. After performing the feature selection to select the most relevant k genes, all possibly generated 2^k-1 combinations are tested for their performance in AUC. To avoid an exhaustive testing of all the combinations which is a computationaly comsuming process O(2^k), we designed a strategy allowing to reducing the solution space by filtering out less performing combinations, and keeping only certainof them. Those combinations are then evaluated to be potential solutions for the problem. This strategy is applied before any calculation of the performance of the combination space. Basically, the dataset is splitted on two parts, and a Mean Decrease in AUC MDAUC on the test partition is calculated for each gene selected by the FS process. This reflects the contribution of the genes. This contribution is then calculated at the signature level, and each signature score is compared to a threshold on basis..

Also known as: Ahmed