Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

ISNN
2004
Springer

favoriteEmaildiscussreport

196views Neural Networks» more ISNN 2004»

Sparse Bayesian Learning Based on an Efficient Subset Selection

13 years 9 months ago

Sparse Bayesian Learning Based on an Efficient Subset Selection

Download ttic.uchicago.edu

Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale problems. Experiments on synthetic and benchmark data sets confirm the feasibility and validity of the proposed algorithm.

Liefeng Bo, Ling Wang, Licheng Jiao

Real-time Traffic

Bayesian Learning Algorithm | Benchmark Data Sets | ISNN 2004 | Large Scale Problems |

claim paper

Related Content

» Efficient subset selection based on the Renyi entropy

» Expectation Propagation for Bayesian Multitask Feature Selection

» Bayesian sparse sampling for online reward optimization

» Bayesian Network Classifiers Versus kNN Classifier Using Sequential Feature Selection

» The Bayesian backfitting relevance vector machine

» Nonparametric Bayesian feature selection for multitask learning

» Learning with Mixtures of Trees

» Variancecomponent based sparse signal reconstruction and model selection

» Minimum Description Length Penalization for Group and MultiTask Sparse Learning

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	ISNN
Authors	Liefeng Bo, Ling Wang, Licheng Jiao

Comments (0)