Search
Results
-
Estimating high-dimensional directed acyclic graphs with the PC-algorithm
(2005)Research reportWe consider the PC-algorithm Spirtes et. al. (2000) for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse problems with many nodes, i.e. variables, and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underlying DAG. We prove consistency ...Report -
-
Comparison of Biclustering Methods: A Systematic Comparison and Evaluation of Biclustering Methods for Gene Expression Data
(2005)TIK ReportIn recent years, there have been various efforts to over-come the limitations of standard clustering approaches for the analysis of gene expression data by grouping genes and samples simultaneously.The underlying concept, which is often referred to as biclustering, allows to identify sets of genes sharing compatible expression patterns across subsets of samples, and its usefulness has been demonstrated for different organisms and data ...Report