English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Leveraging Sequence Classification by Taxonomy-Based Multitask Learning

Widmer, C., Leiva, J., Altun, Y., & Rätsch, G. (2010). Leveraging Sequence Classification by Taxonomy-Based Multitask Learning. In B. Berger (Ed.), RECOMB 2010: Research in Computational Molecular Biology (pp. 522-534). Berlin, Germany: Springer.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files

Locators

show
hide
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Widmer, C1, Author           
Leiva, JM2, 3, Author           
Altun, Y2, 3, Author           
Rätsch, G1, Author           
Affiliations:
1Friedrich Miescher Laboratory, Max Planck Society, Max-Planck-Ring 9, 72076 Tübingen, DE, ou_2575692              
2Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
3Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: In this work we consider an inference task that biologists are very good at: deciphering biological processes by bringing together knowledge that has been obtained by experiments using various organisms, while respecting the differences and commonalities of these organisms. We look at this problem from an sequence analysis point of view, where we aim at solving the same classification task in different organisms. We investigate the challenge of combining information from several organisms, whereas we consider the relation between the organisms to be defined by a tree structure derived from their phylogeny. Multitask learning, a machine learning technique that recently received considerable attention, considers the problem of learning across tasks that are related to each other. We treat each organism as one task and present three novel multitask learning methods to handle situations in which the relationships among tasks can be described by a hierarchy. These algorithms are designed for large-scale applications and are therefore applicable to problems with a large number of training examples, which are frequently encountered in sequence analysis. We perform experimental analyses on synthetic data sets in order to illustrate the properties of our algorithms. Moreover, we consider a problem from genomic sequence analysis, namely splice site recognition, to illustrate the usefulness of our approach. We show that intelligently combining data from 15 eukaryotic organisms can indeed significantly improve the prediction performance compared to traditional learning approaches. On a broader perspective, we expect that algorithms like the ones presented in this work have the potential to complement and enrich the strategy of homology-based sequence analysis that are currently the quasi-standard in biological sequence analysis.

Details

show
hide
Language(s):
 Dates: 2010-04
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-642-12683-3_34
 Degree: -

Event

show
hide
Title: 14th International Conference on Research in Computational Molecular Biology (RECOMB 2010)
Place of Event: Lisboa, Portugal
Start-/End Date: 2010-04-25 - 2010-04-28

Legal Case

show

Project information

show

Source 1

show
hide
Title: RECOMB 2010: Research in Computational Molecular Biology
Source Genre: Proceedings
 Creator(s):
Berger, B, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 522 - 534 Identifier: ISBN: 978-3-642-12682-6

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 6044 Sequence Number: - Start / End Page: - Identifier: -