Associative clustering for exploring dependencies between functional genomics data sets.
High-throughput genomic measurements, interpreted as cooccurring data samples from multiple sources, open up a fresh problem for machine learning: What is in common in the different data sets, that is, what kind of statistical dependencies are there between the paired samples from the different sets? We introduce a clustering algorithm for exploring the dependencies. Samples within each data set are grouped such that the dependencies between groups of different sets capture as much of pairwise dependencies between the samples as possible. We formalize this problem in a novel probabilistic way, as optimization of a Bayes factor. The method is applied to reveal commonalities and exceptions in gene expression between organisms and to suggest regulatory interactions in the form of dependencies between gene expression profiles and regulator binding patterns.
Kaski
Samuel
S
University of Helsinki, Department of Computer Science, PO Box 68, FI-00014 University of Helsinki, Finland. samuel.kaski@cs.helsinki.fi
Nikkilä
Janne
J
Sinkkonen
Janne
J
Lahti
Leo
L
Knuuttila
Juha E A
JE
Roos
Christophe
C
D000465:Algorithms; D001185:Artificial Intelligence; D002874:Chromosome Mapping / Q000379:methods*; D016000:Cluster Analysis; D003198:Computer Simulation; D030541:Databases, Genetic; D020869:Gene Expression Profiling / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D008957:Models, Genetic; D005810:Multigene Family / Q000502:physiology*; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods; D013223:Statistics as Topic