Nonparametric Model Learning Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "]] ** " to "]]. ** ")
m (Text replacement - ". " to ". ")
Line 31: Line 31:


=== 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.
** QUOTE: … FSF exists as a compromise since, like Boosting, it is a <B>[[Nonparametric Model Learning Algorithm|nonparametric learning algorithm]]</B> that works with different loss functions and large numbers of base ...
** QUOTE: … FSF exists as a compromise since, like Boosting, it is a <B>[[Nonparametric Model Learning Algorithm|nonparametric learning algorithm]]</B> that works with different loss functions and large numbers of base ...



Revision as of 13:15, 2 August 2022

A nonparametric model learning algorithm is a model learning algorithm/statistical modeling algorithm that makes few assumptions about underlying probability distributions.



References

2009


2004

1999

1998