通过随机接受的轮盘选择
Roulette-wheel selection via stochastic acceptance
摘要:
轮盘选择是遗传和进化算法或复杂网络建模中经常使用的方法。现有的例程使用O(N)或O(log(N))复杂度的搜索算法从N个个体中选择一个。我们提出了一个简单的roulette-wheel选择算法,它通常具有O(1)的复杂度,是基于随机接受,而不是搜索。我们还讨论了一个混合版本,这可能是适合高度异构的权重分布,发现,例如,在一些模型的复杂网络。通过微小的修改,该算法也可以用于在某个值处具有适应度截止值的采样或用于没有替换的采样。
英文摘要:
Roulette-wheel selection is a frequently used method in genetic and evolutionary algorithms or in modeling of complex networks. Existing routines select one of N individuals using search algorithms of O(N) or O(log(N)) complexity. We present a simple roulette-wheel selection algorithm, which typically has O(1) complexity and is based on stochastic acceptance instead of searching. We also discuss a hybrid version, which might be suitable for highly heterogeneous weight distributions, found, for example, in some models of complex networks. With minor modifications, the algorithm might also be used for sampling with fitness cut-off at a certain value or for sampling without replacement.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。