楼主: Glorevo
1562 1

Foundations of Statistical Algorithms [推广有奖]

  • 12关注
  • 7粉丝

已卖:3062份资源

讲师

33%

还不是VIP/贵宾

-

威望
0
论坛币
18045 个
通用积分
85.0237
学术水平
49 点
热心指数
114 点
信用等级
36 点
经验
13132 点
帖子
486
精华
0
在线时间
288 小时
注册时间
2011-4-4
最后登录
2025-4-5

楼主
Glorevo 发表于 2018-7-23 15:11:58 |AI写论文

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币

统计学算法,R 语言描述

洋洋洒洒 500 页


A new and refreshingly different approach to presenting the foundations of statistical algorithms, Foundations of Statistical Algorithms: With References to R Packages reviews the historical development of basic algorithms to illuminate the evolution of today’s more powerful statistical algorithms. It emphasizes recurring themes in all statistical algorithms, including computation, assessment and verification, iteration, intuition, randomness, repetition and parallelization, and scalability. Unique in scope, the book reviews the upcoming challenge of scaling many of the established techniques to very large data sets and delves into systematic verification by demonstrating how to derive general classes of worst case inputs and emphasizing the importance of testing over a large number of different inputs.

Broadly accessible, the book offers examples, exercises, and selected solutions in each chapter as well as access to a supplementary website. After working through the material covered in the book, readers should not only understand current algorithms but also gain a deeper understanding of how algorithms are constructed, how to evaluate new algorithms, which recurring principles are used to tackle some of the tough problems statistical programmers face, and how to take an idea for a new method and turn it into something practically useful.

1.png

2.png

Foundations of Statistical Algorithms.pdf (3.79 MB, 需要: 19 个论坛币)


二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:语言描述 统计学

沙发
Enthuse(未真实交易用户) 发表于 2018-7-24 07:24:59
thanks ..

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
jg-xs1
拉您进交流群
GMT+8, 2026-1-2 21:20