ACM Home Page
Please provide us with feedback. Feedback
Hierarchic Bayesian models for kernel learning
Full text PdfPdf (859 KB)
Source ACM International Conference Proceeding Series; Vol. 119 archive
Proceedings of the 22nd international conference on Machine learning table of contents
Bonn, Germany
Pages: 241 - 248  
Year of Publication: 2005
ISBN:1-59593-180-5
Authors
Mark Girolami  University of Glasgow, UK
Simon Rogers  University of Glasgow, UK
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 20,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1102351.1102382
What is a DOI?

ABSTRACT

The integration of diverse forms of informative data by learning an optimal combination of base kernels in classification or regression problems can provide enhanced performance when compared to that obtained from any single data source. We present a Bayesian hierarchical model which enables kernel learning and present effective variational Bayes estimators for regression and classification. Illustrative experiments demonstrate the utility of the proposed method. Matlab code replicating results reported is available at http://www.dcs.gla.ac.uk/~srogers/kernel_comb.html.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Andrews, D., & Mallows, C. (1974). Scale mixtures of Normal distributions. Journal of the Royal Statistical Society, Series B, 36, 99--102.
2
 
3
Bach, F. R., Thibaux, R., & Jordan, M. I. (2005). Computing regularization paths for learning multiple kernels. In L. K. Saul. Y. Weiss and L. Bottou (Eds.), Advances in neural information processing systems 17. Cambridge. MA: MIT Press.
 
4
Beal, M. (2003). Variational algorithms for approximate bayesian inference. Doctoral dissertation, University College London.
 
5
 
6
Bousquet, O., & Herrmann, D. J. L. (2003). On the complexity of learning the kernel matrix. In S. T. S. Becker and K. Obermayer (Eds.), Advances in neural information processing systems 15, 399--406. Cambridge, MA: MIT Press.
 
7
Crammer, K., Keshet, J., & Singer, Y. (2003). Kernel design using boosting. In S. T. S. Becker and K. Obermayer (Eds.), Advances in neural information processing systems 15, 537--544. Cambridge, MA: MIT Press.
 
8
Cristianini, N., Shawe-Taylor, J., Elisseeff, A., & Kandola. J. (2002). On kernel-target alignment. Advances in Neural Information Processing Systems 14. Cambridge, MA: MIT Press.
9
 
10
 
11
 
12
 
13
Kolenda, T., Hansen, L., Larsen, J., & Winther, O. (2002). Independent component analysis for understanding multimedia content. Proceedings of IEEE Workshop on Neural Networks for Signal Processing XII (pp. 757--766).
 
14
John Lafferty , Guy Lebanon, Diffusion Kernels on Statistical Manifolds, The Journal of Machine Learning Research, 6, p.129-163, 9/1/2005
 
15
 
16
 
17
 
18
 
19
Ong, C. S., Smola, A. J., & Williamson, R. C. (2003). Hyperkernels. In S. T. S. Becker and K. Obermayer (Eds.), Advances in neural information processing systems 15, 478--485. Cambridge, MA: MIT Press.
 
20
 
21
 
22
Tsang, I. W., & Kwok, J. T. (2004). Efficient hyperkernel learning using second-order cone programming. Proceedings of the 15th European Conference on Machine Learning (pp. 453--464).
23

Collaborative Colleagues:
Mark Girolami: colleagues
Simon Rogers: colleagues