Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/2480
Title: | L1 LASSO and its Bayesian Inference | Contributor(s): | Gao, Junbin (author); Antolovich, Michael (author); Kwan, Paul Hing (author) | Publication Date: | 2008 | Handle Link: | https://hdl.handle.net/1959.11/2480 | Abstract: | A new iterative procedure for solving regression problems with the so-called LASSO penalty is proposed by using generative Bayesian modeling and inference. The algorithm produces the anticipated parsimonious or sparse regression models that generalize well on unseen data. The proposed algorithm is quite robust and there is no need to specify any model hyperparameters. A comparison with state-of-the-art methods for constructing sparse regression models such as the relevance vector machine (RVM) and the local regularization assisted orthogonal least squares regression (LROLS) is given. | Publication Type: | Conference Publication | Conference Details: | AI 2008: 21st Australasian Joint Conference on Artificial Intelligence, Auckland, New Zealand, December 1-5, 2008 | Source of Publication: | AI 2008: advances in artificial intelligence : 21st Australasian Joint Conference on Artificial Intelligence, Auckland, New Zealand, December 1-5, 2008, p. 318-324 | Publisher: | Springer | Place of Publication: | Berlin, Germany | Fields of Research (FoR) 2008: | 080109 Pattern Recognition and Data Mining | Socio-Economic Objective (SEO) 2008: | 890299 Computer Software and Services not elsewhere classified | HERDC Category Description: | E1 Refereed Scholarly Conference Publication | Publisher/associated links: | http://nla.gov.au/anbd.bib-an44000781 | Series Name: | Lecture notes in artificial intelligence Lecture notes in computer science |
Series Number : | 5360 |
---|---|
Appears in Collections: | Conference Publication |
Files in This Item:
File | Description | Size | Format |
---|
Page view(s)
1,056
checked on Mar 7, 2023
Download(s)
2
checked on Mar 7, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.