|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM211013048 |
| 003 |
DE-627 |
| 005 |
20231224012719.0 |
| 007 |
tu |
| 008 |
231224s1982 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0703.xml
|
| 035 |
|
|
|a (DE-627)NLM211013048
|
| 035 |
|
|
|a (NLM)21869046
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Trunk, G V
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Repeated hypothesis testing on a growing data set
|
| 264 |
|
1 |
|c 1982
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 02.10.2012
|
| 500 |
|
|
|a Date Revised 12.11.2019
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a In many problems, especially when data are collected over a long period of time, hypothesis testing is done repeatedly as new data arrive. It is shown both for one particular problem and for a more general class of problems that if testing is performed each time on the total amount of data accumulated, the true simple null hypothesis will be rejected at least once as the number of tests approaches infinity. Furthermore, it is conjectured that the conclusion holds for most problems of interest in which the null hypothesis is simple
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Coleman, J O
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 4(1982), 3 vom: 01. März, Seite 343-5
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:4
|g year:1982
|g number:3
|g day:01
|g month:03
|g pages:343-5
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 4
|j 1982
|e 3
|b 01
|c 03
|h 343-5
|