首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Obtaining species: sample size considerations
Authors:Trent L McDonald  David S Birkes  N Scott Urquhart
Institution:(1) West Inc., 2003 Central Avenue, 82001 Cheyenne, WY, USA;(2) Department of Statistics, Oregon State University, Corvallis, OR, USA
Abstract:Suppose fish are to be sampled from a stream. A fisheries biologist might ask one of the following three questions: ‘How many fish do I need to catch in order to see all of the species?’, ‘How many fish do I need to catch in order to see all species whose relative frequency is more than 5%?’, or ‘How many fish do I need to catch in order to see a member from each of the species A, B, and C?’. This paper offers a practical solution to such questions by setting a target sample size designed to achieve desired results with known probability. We present three sample size methods, one we call ‘exact’ and the others approximate. Each method is derived under assumed multinomial sampling, and requires (at least approximate) independence of draws and (usually) a large population. The minimum information needed to compute one of the approximate methods is the estimated relative frequency of the rarest species of interest. Total number of species is not needed. Choice of a sample size method depends largely on available computer resources. One approximation (called the ‘Monte Carlo approximation’) gets within ±6 units of exact sample size, but usually requires 20–30 minutes of computer time to compute. The second approximation (called the ‘ratio approximation’) can be computed manually and has relative error under 5% when all species are desired, but can be as much as 50% or more too high when exact sample size is small. Statistically, this problem is an application of the ‘sequential occupancy problem’. Three examples are given which illustrate the calculations so that a reader not interested in technical details can apply our results.
Keywords:multinomial distribution  occupancy problem  species richness  urn model
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号