Variational relevance vector machine for tabular data

ISSN: 15324435
5Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

We adopt the Relevance Vector Machine (RVM) framework to handle cases of tablestructured data such as image blocks and image descriptors. This is achieved by coupling the regularization coefficients of rows and columns of features. We present two variants of this new gridRVM framework, based on the way in which the regularization coefficients of the rows and columns are combined. Appropriate variational optimization algorithms are derived for inference within this framework. The consequent reduction in the number of parameters from the product of the table's dimensions to the sum of its dimensions allows for better performance in the face of small training sets, resulting in improved resistance to overfitting, as well as providing better interpretation of results. These properties are demonstrated on synthetic data-sets as well as on a modern and challenging visual identification benchmark. © 2010 Dmitry Kropotov, Dmitry Vetrov, Lior Wolf, and Tal Hassner.

Cite

CITATION STYLE

APA

Kropotov, D., Vetrov, D., Wolf, L., & Hassner, T. (2010). Variational relevance vector machine for tabular data. In Journal of Machine Learning Research (Vol. 13, pp. 79–94).

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