Sparse bayesian learning based on an efficient subset selection

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Bo, L., Wang, L., & Jiao, L. (2004). Sparse bayesian learning based on an efficient subset selection. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3173, 264–269. https://doi.org/10.1007/978-3-540-28647-9_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free