4.7 Article

Inferring adaptive regulation thresholds and association rules from gene expression data through combinatorial optimization learning

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TCBB.2007.1049

关键词

combinatorial optimization; genetic regulatory networks; machine learning; gene expression data; decision trees

向作者/读者索取更多资源

There is a need to design computational methods to support the prediction of gene regulatory networks (GRNs). Such models should offer both biologically meaningful and computationally accurate predictions which, in combination with other techniques, may improve large-scale integrative studies. This paper presents a new machine-learning method for the prediction of putative regulatory associations from expression data which exhibit properties never or only partially addressed by other techniques recently published. The method was tested on a Saccharomyces cerevisiae gene expression data set. The results were statistically validated and compared with the relationships inferred by two machine-learning approaches to GRN prediction. Furthermore, the resulting predictions were assessed using domain knowledge. The proposed algorithm may be able to accurately predict relevant biological associations between genes. One of the most relevant features of this new method is the prediction of adaptive regulation thresholds for the discretization of gene expression values, which is required prior to the rule association learning process. Moreover, an important advantage consists of its low computational cost to infer association rules. The proposed system may significantly support exploratory large-scale studies of automated identification of potentially relevant gene expression associations.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据