摘要:
Boosting is a greedy alogrithm. The alogrithm works by applying the weak learner sequentially to weighted version of the data, where more weight is gi 阅读全文
posted @ 2017-05-21 13:37
Vpegasus
阅读(379)
评论(0)
推荐(0)
浙公网安备 33010602011771号