Sciweavers

65 search results - page 6 / 13
» On the number of combinations without certain separations
Sort
View
BMCBI
2007
125views more  BMCBI 2007»
13 years 7 months ago
Bayesian meta-analysis models for microarray data: a comparative study
Background: With the growing abundance of microarray data, statistical methods are increasingly needed to integrate results across studies. Two common approaches for meta-analysis...
Erin M. Conlon, Joon J. Song, Anna Liu
ICANN
2007
Springer
13 years 11 months ago
An Efficient Search Strategy for Feature Selection Using Chow-Liu Trees
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
CSB
2005
IEEE
165views Bioinformatics» more  CSB 2005»
13 years 9 months ago
Sequential Diagonal Linear Discriminant Analysis (SeqDLDA) for Microarray Classification and Gene Identification
In microarray classification we are faced with a very large number of features and very few training samples. This is a challenge for classical Linear Discriminant Analysis (LDA),...
Roger Pique-Regi, Antonio Ortega, Shahab Asgharzad...
SIAMSC
2008
140views more  SIAMSC 2008»
13 years 7 months ago
Compact Fourier Analysis for Designing Multigrid Methods
The convergence of Multigrid methods can be analyzed based on a Fourier analysis of the method or by proving certain inequalities that have to be fulfilled by the smoother and by t...
Thomas K. Huckle
SPAA
2004
ACM
14 years 23 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter