Information-based objective functions for active data selection
Neural Computation
A family of algorithms for approximate bayesian inference
A family of algorithms for approximate bayesian inference
Sparse bayesian learning and the relevance vector machine
The Journal of Machine Learning Research
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Thumbs up?: sentiment classification using machine learning techniques
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
Bayesian compressive sensing and projection optimization
Proceedings of the 24th international conference on Machine learning
The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms
Proceedings of the 25th international conference on Machine learning
Bayesian Inference and Optimal Design for the Sparse Linear Model
The Journal of Machine Learning Research
Consistency of the Group Lasso and Multiple Kernel Learning
The Journal of Machine Learning Research
The Bayesian group-Lasso for analyzing contingency tables
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
IEEE Transactions on Signal Processing
Hub gene selection methods for the reconstruction of transcription networks
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Expectation propagation for Bayesian multi-task feature selection
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Network-based sparse Bayesian classification
Pattern Recognition
The group-lasso: l1,∞regularization versus l1,2regularization
Proceedings of the 32nd DAGM conference on Pattern recognition
Expectation-propagation for the generative aspect model
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A sparse signal reconstruction perspective for source localization with sensor arrays
IEEE Transactions on Signal Processing - Part II
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Group-Lasso on Splines for Spectrum Cartography
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
We describe a Bayesian method for group feature selection in linear regression problems. The method is based on a generalized version of the standard spike-and-slab prior distribution which is often used for individual feature selection. Exact Bayesian inference under the prior considered is infeasible for typical regression problems. However, approximate inference can be carried out efficiently using Expectation Propagation (EP). A detailed analysis of the generalized spike-and-slab prior shows that it is well suited for regression problems that are sparse at the group level. Furthermore, this prior can be used to introduce prior knowledge about specific groups of features that are a priori believed to be more relevant. An experimental evaluation compares the performance of the proposed method with those of group LASSO, Bayesian group LASSO, automatic relevance determination and additional variants used for group feature selection. The results of these experiments show that a model based on the generalized spike-and-slab prior and the EP algorithm has state-of-the-art prediction performance in the problems analyzed. Furthermore, this model is also very useful to carry out sequential experimental design (also known as active learning), where the data instances that are most informative are iteratively included in the training set, reducing the number of instances needed to obtain a particular level of prediction accuracy.