Computer Science – Learning
Scientific paper
2010-08-03
Computer Science
Learning
Scientific paper
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.
Ifrim Georgiana
Wiuf Carsten
No associations
LandOfFree
Bounded Coordinate-Descent for Biological Sequence Classification in High Dimensional Predictor Space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bounded Coordinate-Descent for Biological Sequence Classification in High Dimensional Predictor Space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded Coordinate-Descent for Biological Sequence Classification in High Dimensional Predictor Space will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-614861