博客
关于我
Introduction of moving block bootstrap (MBB)algorithm
阅读量:243 次
发布时间:2019-03-01

本文共 1186 字,大约阅读时间需要 3 分钟。

???????MMB????????????

??????????????????????????????????Moving Block Bootstrap, MBB????????????MMB???????????????????????????????????????????????

????

??????????????????????????????????2???????????????????????????????

X?, X?, ..., X??

???????

  • ?1?X?, X?
  • ?2?X?, X?
  • ...
  • ?5?X?, X??

Bootstrap??

????????Bootstrap?????????????????????????????????????????????????????????????????????1??3??5??1??2?????????????????

block1, block3, block5, block1, block2

Python??

?Python????????arch??????????????????????

from arch.bootstrap import MovingBlockBootstrapfrom numpy.random import RandomStateimport numpy as np# ???????????????y = standard_normal((6, 1))  # shape (6, 1)# ????????bootstrap = MovingBlockBootstrap(2, y, random_state=RandomState(1234))  # ????2# ??Bootstrap??bs_y = []# ??Bootstrap??for _ in range(2):    data = bootstrap.bootstrap(2)  # ??2?Bootstrap??    bs_y.append(data[0][0])  # ???????    print("Bootstrap??:", data)    print("??????:", bs_y)# ????????def fc(a):    return a.mean(0)  # ?????# ?????????results = bootstrap.apply(fc, 2)  # ?????????????print("????:", results)

??

??????????????????????????????????????????????????????????????????????????????????????????????????

转载地址:http://uaet.baihongyu.com/

你可能感兴趣的文章
POJ2390 Bank Interest【水题】
查看>>
poj2398
查看>>
poj2478欧拉函数
查看>>
poj2546
查看>>
POJ2728 Desert King
查看>>
POJ2794 Double Patience[离散概率 状压DP]
查看>>
poj2828(线段树查找序列第k小的值)
查看>>
POJ2891:Strange Way to Express Integers——题解
查看>>
poj3045 Cow Acrobats(二分最大化最小值)
查看>>
poj3061 Subsequence(尺取法)
查看>>
poj3074 DLX精确覆盖
查看>>
poj3252(组合数)
查看>>
Qt笔记——QToolBox开发简易QQ聊天界面
查看>>
poj3307
查看>>
Qt笔记——QString与隐式共享、MVC架构
查看>>
Qt笔记——QSemaphore处理生产者/消费者模式
查看>>
Qt笔记——QMutex&QWaitCondition处理生产者消费者模式
查看>>
Qt笔记——QLable+QPixmap图片缩放踩坑
查看>>
Qt笔记——foreach与forever
查看>>
QT程序怎么挪到Linux下,linux+Qt程序如何打包发布
查看>>