Subset complement addition upper bounds. An improved inclusion-exclusion method (Q920504)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4163920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subset complement addition upper bounds. An improved inclusion-exclusion method |
scientific article; zbMATH DE number 4163920 |
Statements
Subset complement addition upper bounds. An improved inclusion-exclusion method (English)
0 references
1990
0 references
This paper presents the `Subset Complement Addition Upper Bound' (SCAUB) procedure which produces upper bounds for probabilities of unions of n events given that probabilities of unions and/or intersections of subsets including up to k events are known. The SCAUB method is an extension of \textit{D. Hunter}'s [J. Appl. Probab. 13, 597-603 (1976; Zbl 0349.60007)] improved Bonferroni bounds.
0 references
Hunter bound
0 references
inclusion-exclusion
0 references
multivariate normal distributions
0 references
simultaneous inference
0 references
Subset Complement Addition Upper Bound
0 references
probabilities of unions
0 references
SCAUB method
0 references
improved Bonferroni bounds
0 references
0.782397985458374
0 references
0.7626460194587708
0 references
