An improved optimization method for the relevance voxel machine

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we will re-visit the Relevance Voxel Machine (RVoxM), a recently developed sparse Bayesian framework used for predicting biological markers, e.g., presence of disease, from high-dimensional image data, e.g., brain MRI volumes. The proposed improvement, called IRVoxM, mitigates the shortcomings of the greedy optimization scheme of the original RVoxM algorithm by exploiting the form of the marginal likelihood function. In addition, it allows voxels to be added and deleted from the model during the optimization. In our experiments we show that IRVoxM outperforms RVoxM on synthetic data, achieving a better training cost and test root mean square error while yielding sparser models. We further evaluated IRVoxM's performance on real brain MRI scans from the OASIS data set, and observed the same behavior - IRVoxM retains good prediction performance while yielding much sparser models than RVoxM. © 2013 Springer International Publishing.

Cite

CITATION STYLE

APA

Ganz, M., Sabuncu, M. R., & Van Leemput, K. (2013). An improved optimization method for the relevance voxel machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8184 LNCS, pp. 147–154). Springer Verlag. https://doi.org/10.1007/978-3-319-02267-3_19

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