Simple Random Sample without ReplacementΒΆ
Global Algorithm - One-Dimensional Algorithm
Simple Random Sample without Replacement algorithm is a random process that samples all data values with equal probability. A data value in the original data set is randomly chosen and moved to the output data set. Different from the Simple Random Sample with Replacement algorithm, the randomly chosen value is not placed back in the original data set after it is chosen so that it cannot 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\) | |
\(s\) | \(s \in \mathbb N\) | \(s \leq N\) | The size of output data set |
Output Parameters
Parameter | Type | Constraint | Description | Remarks |
---|---|---|---|---|
\(\hat{Y}\) | \(\hat{Y} \in \mathbb R^s\) | \(s \leq N\) | Output data vector of length \(s\) |
Tool Support
-
For details refer to the online documentation of the function ‘randsample’.
Single Steps using the Algorithm
References
- J. Han, M. Kamber and J. Pei, Data Mining - Concepts and Techniques, 3rd ed., Amsterdam: Morgan Kaufmann Publishers, 2012.