Temporal Ordering of Cancer Microarray Data through a Reinforcement Learning Based Approach

5Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

Abstract

Temporal modeling and analysis and more specifically, temporal ordering are very important problems within the fields of bioinformatics and computational biology, as the temporal analysis of the events characterizing a certain biological process could provide significant insights into its development and progression. Particularly, in the case of cancer, understanding the dynamics and the evolution of this disease could lead to better methods for prediction and treatment. In this paper we tackle, from a computational perspective, the temporal ordering problem, which refers to constructing a sorted collection of multi-dimensional biological data, collection that reflects an accurate temporal evolution of biological systems. We introduce a novel approach, based on reinforcement learning, more precisely, on Q-learning, for the biological temporal ordering problem. The experimental evaluation is performed using several DNA microarray data sets, two of which contain cancer gene expression data. The obtained solutions are correlated either to the given correct ordering (in the cases where this is provided for validation), or to the overall survival time of the patients (in the case of the cancer data sets), thus confirming a good performance of the proposed model and indicating the potential of our proposal. © 2013 Czibula et al.

Cite

CITATION STYLE

APA

Czibula, G., Bocicor, I. M., & Czibula, I. G. (2013). Temporal Ordering of Cancer Microarray Data through a Reinforcement Learning Based Approach. PLoS ONE, 8(4). https://doi.org/10.1371/journal.pone.0060883

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free