结构基因选择的快速算法A fast algorithm for structured gene selection |
|
课程网址: | http://videolectures.net/mlsb2010_mosci_afa/ |
主讲教师: | Sofia Mosci |
开课单位: | 热那亚大学 |
开课时间: | 2010-11-08 |
课程语种: | 英语 |
中文简介: | 当基因必须按组选择时,我们处理基因选择的问题,其中定义先验和代表功能家族的组可能重叠。我们提出了一种新的优化程序来解决[4]中提出的正则化问题,其中组套索罚分被推广到重叠组。虽然在[4]中提出的实现需要复制属于一个组的基因,但是我们的迭代过程提供了可扩展的替代方案而不需要数据复制。这种可扩展性属性允许避免对维度降低进行必要的预处理,这有可能丢弃相关的生物信息,并且导致改进的预测性能和更高的选择稳定性。 |
课程简介: | We deal with the problem of gene selection when genes must be selected group-wise, where the groups, defined a priori and representing functional families, may overlap. We propose a new optimization procedure for solving the regularization problem proposed in [4], where the group lasso penalty is generalized to overlapping groups. While in [4] the proposed implementation requires replication of genes belonging to more than one group, our iterative procedure, provides a scalable alternative with no need for data duplication. This scalability property allows avoiding the otherwise necessary pre-processing for dimensionality reduction, which is at risk of discarding relevant biological information, and leads to improved prediction performances and higher selection stability. |
关 键 词: | 基因选择; 正则化问题; 维度降低 |
课程来源: | 视频讲座网 |
最后编审: | 2019-07-02:cwx |
阅读次数: | 85 |