arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.0528cs.LG
收藏

高维预测空间中生物序列分类的有界坐标下降法

Bounded Coordinate-Descent for Biological Sequence Classification in High Dimensional Predictor Space

Bioinformatics Research Centre (BiRC)(生物信息学研究中心(BiRC))

Georgiana Ifrim, Carsten Wiuf

摘要:

我们提出了一个判别序列分类的框架,其中学习者直接在训练集中所有序列的高维预测空间中工作。这是可能的,通过采用一种新的坐标下降算法,结合边界的梯度的幅度选择判别连续性快。我们的损失函数的特点,我们的通用学习算法可以应用,并提出具体的实现逻辑回归(二项式对数似然损失)和支持向量机(平方铰链损失)。将我们的算法应用于蛋白质远程同源性检测和远程折叠识别导致与最先进的方法(例如,核支持向量机)。与最先进的分类器不同,所得到的分类模型只是加权的区别性顺序的列表,因此可以被解释并与生物学问题相关。

英文摘要:

We present a framework for discriminative sequence classification where the learner works directly in the high dimensional predictor space of all subsequences in the training set. This is possible by employing a new coordinate-descent algorithm coupled with bounding the magnitude of the gradient for selecting discriminative subsequences fast. We characterize the loss functions for which our generic learning algorithm can be applied and present concrete implementations for logistic regression (binomial log-likelihood loss) and support vector machines (squared hinge loss). Application of our algorithm to protein remote homology detection and remote fold recognition results in performance comparable to that of state-of-the-art methods (e.g., kernel support vector machines). Unlike state-of-the-art classifiers, the resulting classification models are simply lists of weighted discriminative subsequences and can thus be interpreted and related to the biological problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑