Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/7612
Title: | Learning Gradients with Gaussian Processes | Contributor(s): | Jiang, Xinwei (author); Gao, Junbin (author); Wang, Tianjiang (author); Kwan, Paul H (author) | Publication Date: | 2010 | DOI: | 10.1007/978-3-642-13672-6_12 | Handle Link: | https://hdl.handle.net/1959.11/7612 | Abstract: | The problems of variable selection and inference of statistical dependence have been addressed by modeling in the gradients learning framework based on the representer theorem. In this paper, we propose a new gradients learning algorithm in the Bayesian framework, called Gaussian Processes Gradient Learning (GPGL) model, which can achieve higher accuracy while returning the credible intervals of the estimated gradients that existing methods cannot provide. The simulation examples are used to verify the proposed algorithm, and its advantages can be seen from the experimental results. | Publication Type: | Book Chapter | Source of Publication: | Advances in Knowledge Discovery and Data Mining: Proceedings of the 14th Pacific-Asia Conference, PAKDD 2010, v.II, p. 113-124 | Publisher: | Springer | Place of Publication: | Berlin, Germany | ISBN: | 3642136710 9783642136719 |
Fields of Research (FoR) 2008: | 080201 Analysis of Algorithms and Complexity 080109 Pattern Recognition and Data Mining 080205 Numerical Computation |
Socio-Economic Objective (SEO) 2008: | 890299 Computer Software and Services not elsewhere classified | HERDC Category Description: | B1 Chapter in a Scholarly Book | Publisher/associated links: | http://trove.nla.gov.au/work/38088900 | Series Name: | Lecture Notes in Artificial Intelligence | Series Number : | 6119 | Editor: | Editor(s): Mohammed J Zaki, Jeffrey Xu Yu, B Ravindran, Vikram Pudi |
---|---|
Appears in Collections: | Book Chapter |
Files in This Item:
File | Description | Size | Format |
---|
SCOPUSTM
Citations
1
checked on Jul 6, 2024
Page view(s)
1,232
checked on Apr 7, 2024
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.