博客
关于我
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/

你可能感兴趣的文章
POJ 1177 Picture(线段树:扫描线求轮廓周长)
查看>>
Qualitor checkAcesso.php 任意文件上传漏洞复现(CVE-2024-44849)
查看>>
POJ 1182 食物链(并查集拆点)
查看>>
POJ 1185 炮兵阵地 (状态压缩DP)
查看>>
POJ 1195 Mobile phones
查看>>
POJ 1228 Grandpa's Estate (稳定凸包)
查看>>
poj 1236(强连通分量分解模板题)
查看>>
poj 1258 Agri-Net
查看>>
quagga 和 zebos
查看>>
poj 1286 Necklace of Beads
查看>>
POJ 1321 棋盘问题
查看>>
poj 1321(回溯)
查看>>
Qt高级——Qt元对象系统源码解析
查看>>
qt调用vs2008编写的dll动态库(隐式调用)
查看>>
Qt读取注册表默认值
查看>>
poj 1679 判断MST是不是唯一的 (次小生成树)
查看>>
POJ 1703 Find them, Catch them
查看>>
POJ 1703 Find them, Catch them 并查集
查看>>
POJ 1738 An old Stone Game(石子合并)
查看>>
POJ 1740 A New Stone Game(博弈)题解
查看>>