Sciweavers

125 search results - page 11 / 25
» Learning missing values from summary constraints
Sort
View
BMCBI
2008
120views more  BMCBI 2008»
13 years 10 months ago
Statistical issues in the analysis of Illumina data
Background: Illumina bead-based arrays are becoming increasingly popular due to their high degree of replication and reported high data quality. However, little attention has been...
Mark J. Dunning, Nuno L. Barbosa-Morais, Andy G. L...
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
14 years 2 months ago
Time Series Forecasting from High-Dimensional Data with Multiple Adaptive Layers
This paper describes our work in learning online models that forecast real-valued variables in a high-dimensional space. A 3GB database was collected by sampling 421 real-valued s...
R. Bharat Rao, Scott Rickard, Frans Coetzee
ICANN
2009
Springer
14 years 2 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
BMCBI
2007
194views more  BMCBI 2007»
13 years 9 months ago
A meta-data based method for DNA microarray imputation
Background: DNA microarray experiments are conducted in logical sets, such as time course profiling after a treatment is applied to the samples, or comparisons of the samples unde...
Rebecka Jörnsten, Ming Ouyang, Hui-Yu Wang
CONNECTION
2004
92views more  CONNECTION 2004»
13 years 9 months ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams