Boosted Lasso Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - " (2006)" to " (2006)") |
m (Text replace - "In this paper" to "In this paper") |
||
| Line 9: | Line 9: | ||
===2004=== | ===2004=== | ||
* ([[2004_BoostedLasso|Zhao & Yu, 2004]]) ⇒ Peng Zhao, and Bin Yu. (2004). "[http://www.stat.berkeley.edu/users/binyu/ps/blasso.sub.pdf Boosted Lasso]." Tech Report, Statistics Department, U. C. Berkeley. | * ([[2004_BoostedLasso|Zhao & Yu, 2004]]) ⇒ Peng Zhao, and Bin Yu. (2004). "[http://www.stat.berkeley.edu/users/binyu/ps/blasso.sub.pdf Boosted Lasso]." Tech Report, Statistics Department, U. C. Berkeley. | ||
** ... In this paper, we propose a new algorithm Boosted Lasso (BLasso). ... | ** ... In [[this paper]], we propose a new algorithm Boosted Lasso (BLasso). ... | ||
---- | ---- | ||
Revision as of 15:20, 15 March 2014
A Boosted Lasso Algorithm is a Lasso Algorithm within a Boosting Algorithm.
References
2006
- Jianfeng Gao, Hisami Suzuki, and Bin Yu. (2006). "Approximation lasso methods for language modeling." In: Proceedings of ACL 2006 Conference. doi:10.3115/1220175.1220204
2004
- (Zhao & Yu, 2004) ⇒ Peng Zhao, and Bin Yu. (2004). "Boosted Lasso." Tech Report, Statistics Department, U. C. Berkeley.
- ... In this paper, we propose a new algorithm Boosted Lasso (BLasso). ...