[C++] 从 0 到 2 亿随机采样(300 个)的最佳实践? - V2EX
zynlp
V2EX    C

[C++] 从 0 到 2 亿随机采样(300 个)的最佳实践?

  •  
  •   zynlp Aug 27, 2018 via iPhone 3718 views
    This topic created in 2833 days ago, the information mentioned may be changed or developed.
    google 了给的结果:
    1、先 shuffle 再取前 300 个
    2、stl::sample ( only c++17 )

    有没有什么其他更好的方法?
    5 replies    2018-08-27 15:17:33 +08:00
    wutiantong
        1
    wutiantong  
       Aug 27, 2018
    从 2 亿个数里随机取一个(std::uniform_int_distribution)记为 a1
    从(2 亿-1)个数里随机取一个记为 a2,if (a2 >= a1) then (a2 += 1)
    从(2 亿-2)个数里随机取一个记为 a3,if (a3 >= max(a1, a2)) then (a3 += 2) elif (a3 >= min(a1, a2)) then (a3 += 1)
    依次类推 300 次
    geelaw
        2
    geelaw  
       Aug 27, 2018
    这个“随机采样”根本没说明白,根据心电感应做题法,你希望从 0 到 2 亿无放回抽样 300 个。

    方法 1:你做 300 次有放回抽样,如果有重复就再来一次。这样做期望 1.00224502750272 次可以得到一个有效结果。这个东西的别名叫做 birthday attack。

    方法 2:按照 #1 的方法挖洞。
    GeruzoniAnsasu
        3
    GeruzoniAnsasu  
       Aug 27, 2018
    不知道这“最佳实践”最佳在哪个方面

    是效率还是随机性还是均匀度还是什么的

    可以参考下这个,stl 默认的随机数引擎
    https://zh.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine
    Nirvanada
        4
    Nirvanada  
       Aug 27, 2018   1
    参考下蓄水池采样
    ipwx
        5
    ipwx  
       Aug 27, 2018
    我觉得 reject sampling 对这个场景其实还行。
    About     Help     Advertise     Blog     API     FAQ     Solana     1690 Online   Highest 6679       Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 35ms UTC 16:16 PVG 00:16 LAX 09:16 JFK 12:16
    Do have faith in what you're doing.
    ubao msn snddm index pchome yahoo rakuten mypaper meadowduck bidyahoo youbao zxmzxm asda bnvcg cvbfg dfscv mmhjk xxddc yybgb zznbn ccubao uaitu acv GXCV ET GDG YH FG BCVB FJFH CBRE CBC GDG ET54 WRWR RWER WREW WRWER RWER SDG EW SF DSFSF fbbs ubao fhd dfg ewr dg df ewwr ewwr et ruyut utut dfg fgd gdfgt etg dfgt dfgd ert4 gd fgg wr 235 wer3 we vsdf sdf gdf ert xcv sdf rwer hfd dfg cvb rwf afb dfh jgh bmn lgh rty gfds cxv xcv xcs vdas fdf fgd cv sdf tert sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf shasha9178 shasha9178 shasha9178 shasha9178 shasha9178 liflif2 liflif2 liflif2 liflif2 liflif2 liblib3 liblib3 liblib3 liblib3 liblib3 zhazha444 zhazha444 zhazha444 zhazha444 zhazha444 dende5 dende denden denden2 denden21 fenfen9 fenf619 fen619 fenfe9 fe619 sdf sdf sdf sdf sdf zhazh90 zhazh0 zhaa50 zha90 zh590 zho zhoz zhozh zhozho zhozho2 lislis lls95 lili95 lils5 liss9 sdf0ty987 sdft876 sdft9876 sdf09876 sd0t9876 sdf0ty98 sdf0976 sdf0ty986 sdf0ty96 sdf0t76 sdf0876 df0ty98 sf0t876 sd0ty76 sdy76 sdf76 sdf0t76 sdf0ty9 sdf0ty98 sdf0ty987 sdf0ty98 sdf6676 sdf876 sd876 sd876 sdf6 sdf6 sdf9876 sdf0t sdf06 sdf0ty9776 sdf0ty9776 sdf0ty76 sdf8876 sdf0t sd6 sdf06 s688876 sd688 sdf86