统计学习基础

哈斯蒂 (Hastie.T.)

出版时间

2008-12-31

ISBN

9787506292313

评分

★★★★★
书籍介绍
这本书在读者口中反复被冠以「圣经」一词,但它真正不可替代之处,不在于罗列了多少流行算法,而在于它坚持用统计学的视角重新审视机器学习:神经网络、支持向量机、分类树、提升法为何有效、又为何失效?短评里有人读完后「相见恨晚」,感叹课程与实习都没教给他的东西,这本书让他看清了自己「啥都不知道」;也有人啃完直呼「一点儿都不基础」——它不满足于告诉你怎么用模型,而是逼你理解模型背后的偏差与方差、估计的稳定性。它适合那些不满足于「调包」、想要追问原理的人;也提醒只想速成的读者:这里的收获需要耐心与数学直觉。这或许正是它评分居高不下的原因。
作者简介
作者:(德国)T.黑斯蒂(Trevor Hastie)
AI导读
核心看点
  • 强调统计概念而非复杂数学推导
  • 涵盖神经网络、SVM等主流算法
  • 从有监督学习延伸至无监督学习
读者共识
  • 统计视角解读机器学习的经典教材
  • 深入剖析模型背后原理,不可替代
  • 内容全面,适合反复阅读以获新知
精彩摘录
  • "LAR uses least squares directions in the active set of variables. Lasso uses least square directions; if a variable crosses zero, it is removed from the active set. Boosting uses non-negative least squares directions in the active set."
  • "the bias of the 1-nearest-neighbor estimate is often low, but the variance is high."
  • "Monte Carlo is an extremely bad method; it should be used only when all alternative methods are worse"
  • "有一个关于Metropolis算法的故事,非常流行:一晚,Edward、Metropolis和Marshall在派对上讨论这个问题,在鸡尾酒餐巾纸上写出了这个闻名的算法。他们最终的论文之所以写上妻子的名字,是为了安抚被整晚的技术性讨论所烦扰的女人Arianna和Augusta"
  • "Bagging; or Bootstrap AGGregatING, is an extension of bootstrapping to classification and regression problems. The main idea is to sample with replacement from the training data so that we now have B training data sets, each having n′≤n observations. The machine-learning algorithm is trained on each"
  • "还是觉得对这本书相见恨晚,研一写那么都web app有毛用啊,就应该踏踏实实的多读书啊~ 还好去实习了,还好发现原来啥都不知道,还好坚持把这本书啃完了,虽然理解的较为粗陋,要不要去读个博呢......真苦恼~"
  • "Both k-nearest neighbors and least squares end up approximating conditional expectatios by averages."
  • "However, with a 0 − 1 outcome, this computation simplifies. We order the predictor classes according to the proportion falling in outcome class 1. Then we split this predictor as if it were an ordered predictor."
求书
收藏