{'fraction_non_alphanumeric': 0.028484231943031537, 'fraction_numerical': 0.02034587995930824, 'mean_word_length': 5.15, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Theory & Methods: Unbiased estimators for restricted adaptive cluster sampling

In adaptive cluster sampling the size of the final sample is random, thus creating design problems. To get round this, Brown (1994) and Brown & Manly (1998) proposed a modification of the method, placing a restriction on the size of the sample, and using standard but biased estimators for estimating the population mean. But in this paper a new unbiased estimator and an unbiased variance estimator are proposed, based on estimators proposed by Murthy (1957) and extended to sequential and adaptive sampling designs by Salehi & Seber (2001). The paper also considers a restricted version of the adaptive scheme of Salehi & Seber (1997a) in which the networks are selected without replacement, and obtains unbiased estimators. The method is demonstrated by a simple example. Using simulation from this example, the new estimators are shown to compare very favourably with the standard biased estimators.