Sampling Algorithms
By: Till�, Yves [author.1].
Contributor(s): .
Material type:
BookSeries: Springer Series in Statistics.New York, NY : Springer New York, 2006. Description: XII, 216 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387342405.Subject(s): | | | | DDC classification: 519.5 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
| PK Kelkar Library, IIT Kanpur | Available | EBKS0007756 |
and Overview -- 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.
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.Yves Till� is a professor at the University of Neuch�tel (Switzerland). 0
There are no comments for this item.