Sampling Algorithms [electronic resource] / by Yves Tillé.
Contributor(s): SpringerLink (Online service)Material type: TextSeries: Springer Series in Statistics: Publisher: New York, NY : Springer New York, 2006Description: XII, 216 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780387342405Subject(s): Statistics | Statistics | Statistical Theory and Methods | Statistics and Computing/Statistics Programs | Statistics for Social Science, Behavorial Science, Education, Public Policy, and LawAdditional physical formats: Printed edition:: No titleDDC classification: 519.5 LOC classification: QA276-280Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
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).