Evaluating Graph Kernel Methods for Relation Discovery in GO-Annotated Clusters
D. Merico1, I. Zoppis1, M. Antoniotti1 and G. Mauri1
| (1) |
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano Bicocca, Via Bicocca degli Arcimboldi
8, U7, I-20126 Milano, Italy |
Abstract
The application of various clustering techniques for large-scale gene-expression measurement experiments is an established
method in bioinformatics. Clustering is also usually accompanied by functional characterization of gene sets by assessing
statistical enrichments of structured vocabularies, such as the Gene Ontology (GO) [1]. If different cluster sets are generated
for correlated experiments, a machine learning step termed cluster meta-analysis may be performed, in order to discover relations among the components of such sets. Several approaches have been proposed
for this step: in particular, kernel methods may be used to exploit the graphical structure of typical ontologies such as GO. Following up the formulation of such approach
[2], in this paper we present and discuss further results about its applicability and its performance, always in the context
of the well known Spellman’s Yeast Cell Cycle dataset [3].
Keywords Clustering - Gene Ontology - Kernel Methods
This work has been supported by EC “Marie Curie” grant MIRG-CT-2005-031140.
References secured to subscribers.