• No results found

Machine Learning in Bioinformatics: preface - fi113-2-01

N/A
N/A
Protected

Academic year: 2021

Share "Machine Learning in Bioinformatics: preface - fi113-2-01"

Copied!
3
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl)

UvA-DARE (Digital Academic Repository)

Machine Learning in Bioinformatics: preface

Ramon, J.; Costa, F.; Costa Florêncio, C.; Kok, J.

DOI

10.3233/FI-2011-601

Publication date

2011

Document Version

Final published version

Published in

Fundamenta Informaticae

Link to publication

Citation for published version (APA):

Ramon, J., Costa, F., Costa Florêncio, C., & Kok, J. (2011). Machine Learning in

Bioinformatics: preface. Fundamenta Informaticae, 113(2), i-ii.

https://doi.org/10.3233/FI-2011-601

General rights

It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons).

Disclaimer/Complaints regulations

If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.

(2)

Fundamenta Informaticae 113 (2011) i-ii i

DOI 10.3233/FI-2011-601 IOS Press

Machine Learning in Bioinformatics

Preface

Computational biology is an application domain where information is naturally represented in terms of relations between heterogeneous objects. Modern experimentation and data acquisition techniques allow the study of complex interactions in biological systems. This raises interesting challenges for machine learning and data mining researchers, as the amount of data is huge, some information cannot be observed, and measurements may be noisy.

This special issue collects three papers on machine learning methods designed to deal with the spe-cific challenges posed by the field of computational biology. Some of these papers are extensions of contributions at the two workshops on Statistical and Relational Learning in Bioinformatics at ECML 2008 and KDD 2009. These were organized to bring together researchers of the machine learning field with specific interest in developing statistical and relational approaches to bioinformatics.

The main problems analyzed in this issue include relation induction, and knowledge sharing between related tasks. Modeling biological problems in a relational framework offers the advantage of a richer representation for expressing dependencies among heterogeneous entities. However the reliable induc-tion and assessment of these dependencies in complex computainduc-tional biology domains is a challenging task. In the first paper, J.M. Arevalillo and H. Navarro present a method, based on random forests, which is particularly robust and capable to detect pairwise dependencies in high dimensional data. The method is then applied to gene expression data. In the second paper, W. Hämäläinen focuses on discovering dependencies amongst multiple entities in an efficient way. The dependency rules are mined according to typical statistical measures, and redundant rules are pruned in order to avoid blurring of dependencies and erroneous conclusions.

Re-using and sharing knowledge from related tasks can improve the performance of predictors. An effective exploitation of this concept in relational models is however a challenging problem. The last paper, by E. Cilia, N. Landwehr and A. Passerini, introduces a hierarchical kFoil algorithm. This algo-rithm is designed to learn multiple targets simultaneously and to then further specialize for each target or target cluster separately. The paper then applies this approach to several bioinformatics problems to demonstrate that the algorithm is both useful and boosts performance.

(3)

ii

We thank the reviewers of the papers in this special issue for their valuable contributions and the authors for their careful consideration of the reviewers’ comments. This resulted in a good quality of the included papers.

Editors Jan Ramon

Katholieke Universiteit Leuven, Belgium Fabrizio Costa

Katholieke Universiteit Leuven, Belgium Christophe Costa Florêncio

University of Amsterdam, Netherlands Joost Kok

Referenties

GERELATEERDE DOCUMENTEN

3 De nutriëntenconcentraties kunnen niet voldoen aan de normen voor het meest vergelijkbare natuurlijke watertype, ook wanneer maximale emissiereductie en mitigatie van ingrepen

Er zijn verschillende systemen die een teler kan ge- bruiken bij het bepalen van het juiste spuitmoment: een vast schema, rekenkundige modellen en biologi- sche modellen.. Hoewel

Voor deze cirkels kunnen we dus de raaklijn in punt ( , ) op de cirkel bepalen door in de cirkelformule 2 te vervangen door en 2 door (“eerlijk delen”).. In de

Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of

Learning modes supervised learning unsupervised learning semi-supervised learning reinforcement learning inductive learning transductive learning ensemble learning transfer

Learning modes supervised learning unsupervised learning semi-supervised learning reinforcement learning inductive learning transductive learning ensemble learning transfer

Uit verschillende onderzoeken is gebleken dat de correlatie tussen adaptief en maladaptief gedrag laag is r < .25 maar dat deze hoger wordt naar mate de ernst van de

Second, with its analytical focus on critical events and typology of CSE management practices, this study contributes to the effective solutioning literature (e.g. Hakanen and