Simple Random Sample with ReplacementΒΆ

Simple Random Sample without Replacement algorithm is a random process that samples all data values equally likely. A data value in the original data set is randomly chosen and moved to the output data set. Different from the Simple Random Sample without Replacement algorithm, the randomly chosen value is placed back in the original data set after it is chosen so that it can be drawn again.

Input Parameters

Parameter Type Constraint Description Remarks
\(Y\) \(Y \in \mathbb R^N\) \(N \in \mathbb{N}\) Input data vector of length \(N\) None
\(s\) \(s \in \mathbb N\) \(s \leq N\) None None

Output Parameters

Parameter Type Constraint Description Remarks
\(\hat{Y}\) \(\hat{Y} \in \mathbb R^s\) \(s \leq N\) Output data vector of length \(s\) None

Single Steps using the Algorithm

References

    1. Han, M. Kamber and J. Pei, Data Mining - Concepts and Techniques, 3rd ed., Amsterdam: Morgan Kaufmann Publishers, 2012.