Sciweavers

8294 search results - page 7 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
ECSQARU
2005
Springer
14 years 2 months ago
Default Clustering from Sparse Data Sets
Categorization with a very high missing data rate is seldom studied, especially from a non-probabilistic point of view. This paper proposes a new algorithm called default clusterin...
Julien Velcin, Jean-Gabriel Ganascia
WABI
2010
Springer
177views Bioinformatics» more  WABI 2010»
13 years 7 months ago
Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data
In this paper we present a novel expectation-maximization algorithm for inference of alternative splicing isoform frequencies from high-throughput transcriptome sequencing (RNA-Seq...
Marius Nicolae, Serghei Mangul, Ion I. Mandoiu, Al...
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
14 years 1 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
JMLR
2010
157views more  JMLR 2010»
13 years 3 months ago
Combining Experiments to Discover Linear Cyclic Models with Latent Variables
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
Frederick Eberhardt, Patrik O. Hoyer, Richard Sche...
AI
2007
Springer
14 years 2 months ago
Learning Network Topology from Simple Sensor Data
In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this...
Dimitri Marinakis, Philippe Giguère, Gregor...