Sparse Kernel Learning and the Relevance Units Machine

Authors:
Junbin Gao;Jun Zhang
Affiliations:
School of Accounting and Computer Science, Charles Sturt University, Bathurst, Australia NSW 2795;School of Accounting and Computer Science, Charles Sturt University, Bathurst, Australia NSW 2795 and Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science ...
Venue:
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Year:
2009

Citing 9
Cited 2

A sparse representation for function approximation

Neural Computation
Variational Relevance Vector Machines

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Sparse bayesian learning and the relevance vector machine

The Journal of Machine Learning Research
Probabilistic Non-linear Principal Component Analysis with Gaussian Process Latent Variable Models

The Journal of Machine Learning Research
A Direct Method for Building Sparse Kernel Learning Algorithms

The Journal of Machine Learning Research
Robust l1 principal component analysis and its bayesian variational inference

Neural Computation
L1 LASSO Modeling and Its Bayesian Inference

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Local regularization assisted orthogonal least squares regression

Neurocomputing
The generalized LASSO

IEEE Transactions on Neural Networks

Probabilistic prediction of protein phosphorylation sites using kernel machines

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Probabilistic prediction of protein phosphorylation sites using classification relevance units machines

ACM SIGAPP Applied Computing Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

The relevance vector machine(RVM) is a state-of-the-art constructing sparse regression kernel model [1,2,3,4]. It not only generates a much sparser model but provides better generalization performance than the standard support vector machine (SVM). In RVM and SVM, relevance vectors (RVs) and support vectors (SVs) are both selected from the input vector set. This may limit model flexibility. In this paper we propose a new sparse kernel model called Relevance Units Machine (RUM). RUM follows the idea of RVM under the Bayesian framework but releases the constraint that RVs have to be selected from the input vectors. RUM treats relevance units as part of the parameters of the model. As a result, a RUM maintains all the advantages of RVM and offers superior sparsity. The new algorithm is demonstrated to possess considerable computational advantages over well-known the state-of-the-art algorithms.