Sciweavers

221 search results - page 35 / 45
» Random Convolution Ensembles
Sort
View
ECSQARU
2009
Springer
14 years 4 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
AUSDM
2006
Springer
202views Data Mining» more  AUSDM 2006»
14 years 1 months ago
A Comparative Study of Classification Methods For Microarray Data Analysis
In response to the rapid development of DNA Microarray technology, many classification methods have been used for Microarray classification. SVMs, decision trees, Bagging, Boostin...
Hong Hu, Jiuyong Li, Ashley W. Plank, Hua Wang, Gr...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 10 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
ICML
2007
IEEE
14 years 10 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
14 years 10 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...