Sparse bayesian learning and the relevance vector machine
The Journal of Machine Learning Research
Introduction to Machine Learning (Adaptive Computation and Machine Learning)
Introduction to Machine Learning (Adaptive Computation and Machine Learning)
Hierarchic Bayesian models for kernel learning
ICML '05 Proceedings of the 22nd international conference on Machine learning
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
An empirical analysis of the probabilistic K-nearest neighbour classifier
Pattern Recognition Letters
Probabilistic multi-class multi-kernel learning
Bioinformatics
ICMLA '08 Proceedings of the 2008 Seventh International Conference on Machine Learning and Applications
Combining feature spaces for classification
Pattern Recognition
Sparse Bayesian modeling with adaptive kernel learning
IEEE Transactions on Neural Networks
Expert Systems with Applications: An International Journal
Localized algorithms for multiple kernel learning
Pattern Recognition
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
A new hybrid intelligent system for accurate detection of Parkinson's disease
Computer Methods and Programs in Biomedicine
Hi-index | 0.01 |
In this paper, we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multiclass multi-kernel relevance vector machines (mRVMs) that have been recently proposed. We provide an insight into the behavior of the mRVM models by performing a wide experimentation on a large range of real-world datasets. Furthermore, we monitor various model fitting characteristics that identify the predictive nature of the proposed methods and compare against existing classification techniques. By introducing novel convergence measures, sample selection strategies and model improvements, it is demonstrated that mRVMs can produce state-of-the-art results on multiclass discrimination problems. In addition, this is achieved by utilizing only a very small fraction of the available observation data.