Sampling Algorithms [electronic resource] /by Yves Tillé.
by Tillé, Yves [author.]; SpringerLink (Online service).
Material type:
Item type | Current location | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
MAIN LIBRARY | QA276-280 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
RC321-580 The Evolving Brain | QA276-280 Stochastic Ageing and Dependence for Reliability | Q334-342 Estimation of Dependences Based on Empirical Data | QA276-280 Sampling Algorithms | QA8.9-10.3 A Concise Introduction to Mathematical Logic | HB1-846.8 Fuzzy Set Approach to Multidimensional Poverty Measurement | HM401-1281 Innovation in Strategic Philanthropy |
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)
There are no comments for this item.