Analysis

Skip to filters. View results.
View results

Filter results by

Search Help
Currently selected filters that can be removed
Remove Remove "Wang, S." filter
Clear all

Keyword(s)

Subject

Year of publication

1 facets displayed. 0 facets selected.

Author(s)

3 facets displayed. 1 facets selected.
Sort Help
entries

Results

All (1)

All (1) ((1 result))

  • 1. Confidence intervals for domain parameters when the domain sample size is random Archived
    Articles and reports: 12-001-X19980013910
    Description:

    Let A be a population domain of interest and assume that the elements of A cannot be identified on the sampling frame and the number of elements in A is not known. Further assume that a sample of fixed size (say n) is selected from the entire frame and the resulting domain sample size (say n_A) is random. The problem addressed is the construction of a confidence interval for a domain parameter such as the domain aggregate T_A = \sum_{i \in A} x_i. The usual approach to this problem is to redefine x_i, by setting x_i = 0 if i \notin A. Thus, the construction of a confidence interval for the domain total is recast as the construction of a confidence interval for a population total which can be addressed (at least asymptotically in n) by normal theory. As an alternative, we condition on n_A and construct confidence intervals which have approximately nominal coverage under certain assumptions regarding the domain population. We evaluate the new approach empirically using artificial populations and data from the Bureau of Labor Statistics (BLS) Occupational Compensation Survey.

    Release date: 1998-07-31
Stats in brief (0)

Stats in brief (0) (0 results)

No content available at this time.

Articles and reports (1)

Articles and reports (1) ((1 result))

  • 1. Confidence intervals for domain parameters when the domain sample size is random Archived
    Articles and reports: 12-001-X19980013910
    Description:

    Let A be a population domain of interest and assume that the elements of A cannot be identified on the sampling frame and the number of elements in A is not known. Further assume that a sample of fixed size (say n) is selected from the entire frame and the resulting domain sample size (say n_A) is random. The problem addressed is the construction of a confidence interval for a domain parameter such as the domain aggregate T_A = \sum_{i \in A} x_i. The usual approach to this problem is to redefine x_i, by setting x_i = 0 if i \notin A. Thus, the construction of a confidence interval for the domain total is recast as the construction of a confidence interval for a population total which can be addressed (at least asymptotically in n) by normal theory. As an alternative, we condition on n_A and construct confidence intervals which have approximately nominal coverage under certain assumptions regarding the domain population. We evaluate the new approach empirically using artificial populations and data from the Bureau of Labor Statistics (BLS) Occupational Compensation Survey.

    Release date: 1998-07-31
Journals and periodicals (0)

Journals and periodicals (0) (0 results)

No content available at this time.

Report a problem or mistake on this page
Date modified:

Search help

How do I use the filters and the search box?

  • You can initiate a search by entering keywords or selecting filters (e.g., under Subject, Geography, etc.) on the left side of the page.

  • Filters can be used together or in any combination. Each time you select a filter, the results on the page are updated.

  • To start a new search, click on the Clear all button above the search box or deselect each filter.

  • Specified keywords and filters appear above the search box. You can deselect any or all the tags to refine or clear your search.

How do I refine my search?

  • You can enter keywords in the search box. It is not necessary to use “+” or “, “ or “AND”.

  • You can delete some or all of the keywords from your search string.

  • Quotes around keywords limit the search to a specific phrase.

    • For example, “labour force survey” will limit results to products containing this phrase.

  • Use “or” between keywords to obtain results that contain one or more search terms.

    • For example, labour or­ force or survey will limit results to products containing any or all of these words.

How does the search work?

  • This search looks for results that have your query term in the title, description, subject, geography, product number or other information about the product.

    • For example, when searching the term ‘Diseases’, all results with the word ‘Diseases’ in the title, description or tagged the subject appear.

  • The text within an article or publication are not searched. For full text searching of articles, use the site search.

Sort help

How are the results ordered?

The Sort by feature provides three options:

  • By date – sorts results by product release date starting with the most recent.
  • By relevance is only needed or beneficial when you use the search box and submit a search query. Results are ordered by a combination of where the search term appears in the content, e.g., if it appears in the title, it likely means the product is more relevant to your search; how up to date or new the content in the product is; how popular the product is; and other factors.
  • By title – sorts results alphabetically.

Sort help

How are the results ordered?

The Sort by feature provides four options:

  • By date – sorts results by product release date starting with the most recent.
  • By most popular – gives priority to results that are most frequently selected by users, followed by the most recent.
  • By relevance is only needed or beneficial when you use the search box and submit a search query. Results are ordered by a combination of where the search term appears in the content, e.g., if it appears in the title, it likely means the product is more relevant to your search; how up to date or new the content in the product is; how popular the product is; and other factors.
  • By title – sorts results alphabetically.