Sparse PLS: Variable Selection when Integrating Omics data - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2008

Sparse PLS: Variable Selection when Integrating Omics data

Résumé

Recent biotechnology advances allow the collection of multiple types of omics data sets, such as transcriptomic, proteomic or metabolomic data to be integrated. The problem of feature selection has been adressed several times in the context of classification, but has to be handled in a specific manner when integrating data. In this study, we focus on the integration of two types of data sets that are measured on the same samples. Our goal is to combine integration and variable selection in a one-step procedure using the good properties of PLS to facilitate the biologists interpretation. A novel computational methodology called sparse PLS is introduced, with two variants depending on the modelling or predictive purpose of the analysis, to deal with these newly arisen problems. The sparsity of our approach is obtained by Lasso penalization of the loading vectors in a SVD PLS version. Sparse PLS is shown to be effective and biologically meaningful. Comparisons with classical PLS are performed on real data sets and a thorough biological interpretation of the results obtained on one data set is provided. We show that sparse PLS not only beneffits from the attractive stability property of PLS but also provide a valuable variable selection tool for high dimensional data sets.

Mots clés

Fichier principal
Vignette du fichier
sPLS.pdf (805.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00300204 , version 1 (17-07-2008)
hal-00300204 , version 2 (23-09-2008)

Identifiants

  • HAL Id : hal-00300204 , version 1

Citer

Kim-Anh Lê Cao, Debra Rossow, Christèle Robert-Granié, Philippe Besse. Sparse PLS: Variable Selection when Integrating Omics data. 2008. ⟨hal-00300204v1⟩
400 Consultations
3862 Téléchargements

Partager

Gmail Facebook X LinkedIn More