Poisson Sampling Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
(Created page with "A Poisson Sampling Algorithm is a Sampling Algorithm where each element of the population that is sampled is subjected to an [[independent B...")
 
m (Text replacement - ". " to ". ")
 
(12 intermediate revisions by the same user not shown)
Line 1: Line 1:
A [[Poisson Sampling Algorithm]] is a [[Sampling Algorithm]] where each element of the [[statistical population|population]] that is sampled is subjected to an [[independent Bernoulli trial]] which determines whether the element becomes part of the sample during the [[drawing of a single sample]].  
A [[Poisson Sampling Algorithm]] is a [[Sampling Algorithm]] where each element of the [[statistical population|population]] that is sampled is subjected to an [[independent Bernoulli trial]] which determines whether the element becomes part of the sample during the [[drawing of a single sample]].
* <B>See:</B> [[Finite Population Sampling]], [[Sampling (Statistics)]], [[Statistical Population]], [[Statistical Independence]], [[Bernoulli Trial]], [[Inclusion Probability]], [[Bernoulli Sampling]].
* <B>See:</B> [[Finite Population Sampling]], [[Sampling (Statistics)]], [[Statistical Population]], [[Statistical Independence]], [[Bernoulli Trial]], [[Inclusion Probability]], [[Bernoulli Sampling]].
----
----
----
----
==References==
 
== References ==


=== 2014 ===
=== 2014 ===
* (Wikipedia, 2014) &rArr; http://en.wikipedia.org/wiki/Poisson_sampling Retrieved:2014-8-26.
* (Wikipedia, 2014) http://en.wikipedia.org/wiki/Poisson_sampling Retrieved:2014-8-26.
** In the theory of [[finite population sampling]], '''Poisson sampling''' is a [[sampling (statistics)|sampling]] process where each element of the [[statistical population|population]] that is sampled is subjected to an [[statistical independence|independent]] [[Bernoulli trial]] which determines whether the element becomes part of the sample during the drawing of a single sample. <P> Each element of the population may have a different probability of being included in the sample. The probability of being included in a sample during the drawing of a single sample is denoted as the ''first-order [[inclusion probability]]'' of that element. If all first-order inclusion probabilities are equal, Poisson sampling becomes equivalent to [[Bernoulli sampling]], which can therefore be considered to be a special case of Poisson sampling.
** In the theory of [[finite population sampling]], '''Poisson sampling</B> is a [[sampling (statistics)|sampling]] process where each element of the [[statistical population|population]] that is sampled is subjected to a [[statistical independence|independent]] [[Bernoulli trial]] which determines whether the element becomes part of the sample during the drawing of a single sample.         <P>       Each element of the population may have a different probability of being included in the sample. The probability of being included in a sample during the drawing of a single sample is denoted as the ''first-order [[inclusion probability]]'' of that element. If all first-order inclusion probabilities are equal, Poisson sampling becomes equivalent to [[Bernoulli sampling]], which can therefore be considered to be a special case of Poisson sampling.


----
----
__NOTOC__
[[Category:Concept]]
[[Category:Concept]]
__NOTOC__

Latest revision as of 13:15, 2 August 2022

A Poisson Sampling Algorithm is a Sampling Algorithm where each element of the population that is sampled is subjected to an independent Bernoulli trial which determines whether the element becomes part of the sample during the drawing of a single sample.



References

2014

  • (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Poisson_sampling Retrieved:2014-8-26.
    • In the theory of finite population sampling, Poisson sampling is a sampling process where each element of the population that is sampled is subjected to a independent Bernoulli trial which determines whether the element becomes part of the sample during the drawing of a single sample.

      Each element of the population may have a different probability of being included in the sample. The probability of being included in a sample during the drawing of a single sample is denoted as the first-order inclusion probability of that element. If all first-order inclusion probabilities are equal, Poisson sampling becomes equivalent to Bernoulli sampling, which can therefore be considered to be a special case of Poisson sampling.