The application of various clustering techniques for largescale 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].
Merico, D., Zoppis, I., Antoniotti, M., Mauri, G. (2007). Evaluating Graph Kernel Methods for Relation Discovery in GO-annotated Clusters. In Knowledge-Based Intelligent Information and Engineering Systems 11th International Conference, KES 2007, Vietri sul Mare, Italy, September 12-14, 2007, Proceedings, Part III (pp.892-900). Springer-Verlag [10.1007/978-3-540-74829-8_109].
Evaluating Graph Kernel Methods for Relation Discovery in GO-annotated Clusters
ZOPPIS, ITALO FRANCESCO;ANTONIOTTI, MARCO;MAURI, GIANCARLO
2007
Abstract
The application of various clustering techniques for largescale 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].
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
