Cargando…

Discovering combinatorial interactions in survival data

Motivation: Although several methods exist to relate high-dimensional gene expression data to various clinical phenotypes, finding combinations of features in such input remains a challenge, particularly when fitting complex statistical models such as those used for survival studies. Results: Our pr...

Descripción completa

Detalles Bibliográficos
Autores principales: duVerle, David A., Takeuchi, Ichiro, Murakami-Tonami, Yuko, Kadomatsu, Kenji, Tsuda, Koji
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2013
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3834797/
https://www.ncbi.nlm.nih.gov/pubmed/24037215
http://dx.doi.org/10.1093/bioinformatics/btt532
_version_ 1782292045129318400
author duVerle, David A.
Takeuchi, Ichiro
Murakami-Tonami, Yuko
Kadomatsu, Kenji
Tsuda, Koji
author_facet duVerle, David A.
Takeuchi, Ichiro
Murakami-Tonami, Yuko
Kadomatsu, Kenji
Tsuda, Koji
author_sort duVerle, David A.
collection PubMed
description Motivation: Although several methods exist to relate high-dimensional gene expression data to various clinical phenotypes, finding combinations of features in such input remains a challenge, particularly when fitting complex statistical models such as those used for survival studies. Results: Our proposed method builds on existing ‘regularization path-following’ techniques to produce regression models that can extract arbitrarily complex patterns of input features (such as gene combinations) from large-scale data that relate to a known clinical outcome. Through the use of the data’s structure and itemset mining techniques, we are able to avoid combinatorial complexity issues typically encountered with such methods, and our algorithm performs in similar orders of duration as single-variable versions. Applied to data from various clinical studies of cancer patient survival time, our method was able to produce a number of promising gene-interaction candidates whose tumour-related roles appear confirmed by literature. Availability: An R implementation of the algorithm described in this article can be found at https://github.com/david-duverle/regularisation-path-following Contact: dave.duverle@aist.go.jp Supplementary information: Supplementary data are available at Bioinformatics online.
format Online
Article
Text
id pubmed-3834797
institution National Center for Biotechnology Information
language English
publishDate 2013
publisher Oxford University Press
record_format MEDLINE/PubMed
spelling pubmed-38347972013-11-21 Discovering combinatorial interactions in survival data duVerle, David A. Takeuchi, Ichiro Murakami-Tonami, Yuko Kadomatsu, Kenji Tsuda, Koji Bioinformatics Original Papers Motivation: Although several methods exist to relate high-dimensional gene expression data to various clinical phenotypes, finding combinations of features in such input remains a challenge, particularly when fitting complex statistical models such as those used for survival studies. Results: Our proposed method builds on existing ‘regularization path-following’ techniques to produce regression models that can extract arbitrarily complex patterns of input features (such as gene combinations) from large-scale data that relate to a known clinical outcome. Through the use of the data’s structure and itemset mining techniques, we are able to avoid combinatorial complexity issues typically encountered with such methods, and our algorithm performs in similar orders of duration as single-variable versions. Applied to data from various clinical studies of cancer patient survival time, our method was able to produce a number of promising gene-interaction candidates whose tumour-related roles appear confirmed by literature. Availability: An R implementation of the algorithm described in this article can be found at https://github.com/david-duverle/regularisation-path-following Contact: dave.duverle@aist.go.jp Supplementary information: Supplementary data are available at Bioinformatics online. Oxford University Press 2013-12-01 2013-09-13 /pmc/articles/PMC3834797/ /pubmed/24037215 http://dx.doi.org/10.1093/bioinformatics/btt532 Text en © The Author 2013. Published by Oxford University Press. http://creativecommons.org/licenses/by/3.0/ This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Original Papers
duVerle, David A.
Takeuchi, Ichiro
Murakami-Tonami, Yuko
Kadomatsu, Kenji
Tsuda, Koji
Discovering combinatorial interactions in survival data
title Discovering combinatorial interactions in survival data
title_full Discovering combinatorial interactions in survival data
title_fullStr Discovering combinatorial interactions in survival data
title_full_unstemmed Discovering combinatorial interactions in survival data
title_short Discovering combinatorial interactions in survival data
title_sort discovering combinatorial interactions in survival data
topic Original Papers
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3834797/
https://www.ncbi.nlm.nih.gov/pubmed/24037215
http://dx.doi.org/10.1093/bioinformatics/btt532
work_keys_str_mv AT duverledavida discoveringcombinatorialinteractionsinsurvivaldata
AT takeuchiichiro discoveringcombinatorialinteractionsinsurvivaldata
AT murakamitonamiyuko discoveringcombinatorialinteractionsinsurvivaldata
AT kadomatsukenji discoveringcombinatorialinteractionsinsurvivaldata
AT tsudakoji discoveringcombinatorialinteractionsinsurvivaldata