Sampling Algorithms
Over the last few decades, important progresses in the methods of sampling have been achieved. This book draws up an inventory of new methods that can be useful for selecting samples. Forty-six sampling methods are described in the framework of general...
Over the last few decades, important progresses in the methods of sampling have been achieved. This book draws up an inventory of new methods that can be useful for selecting samples. Forty-six sampling methods are described in the framework of general theory. The algorithms are described rigorously, which allows implementing directly the described methods. This book is aimed at experienced statisticians who are familiar with the theory of survey sampling.
Over the last few decades, important progresses in the methods of sampling have been achieved. This book draws up an inventory of new methods that can be useful for selecting samples. Forty-six sampling methods are described in the framework of general theory. The algorithms are described rigorously, which allows implementing directly the described methods. This book is aimed at experienced statisticians who are familiar with the theory of survey sampling.
- Population, sample and sampling design
- Sampling algorithms
- Simple random sampling
- Unequal probability exponential designs
- The splitting method
- More on unequal probability designs
- Balanced sampling
- An example of the cube method.
- Autor: Yves Tillé
- 2006, 216 Seiten, Maße: 16,5 x 23,7 cm, Gebunden, Englisch
- Verlag: Springer, New York
- ISBN-10: 0387308148
- ISBN-13: 9780387308142
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Sampling Algorithms".
Kommentar verfassen