Implementation of a sequential TreeScan algorithm for disease surveillance

Georg Hahn First Author
 
Georg Hahn Presenting Author
 
Wednesday, Aug 7: 10:35 AM - 10:50 AM
3270 
Contributed Papers 
Oregon Convention Center 
TreeScan is a popular algorithm for hierarchical testing of hypotheses. The algorithm is used in scenarios where the hypotheses under consideration naturally form a hierarchical tree structure, such as in the areas of pharmaceutical drugs or occupations, thereby allowing one to detect unsuspected relationships. Its tree-based scan statistic only assumes a minimum of prior assumptions about the input, and it adjusts for the multiple testing that is inherent in the tree-based testing scenarios. However, the tree structure of the hypotheses is assumed fixed in TreeScan, thus impeding its use in application areas which require dynamic updates, such as time-varying patient enrollment during trials. For this reason, we extend TreeScan to incorporate a sequential testing design which is capable of controlling either the FWER or the FDR criterion by means of appropriate alpha spending. We apply our improved algorithm to EHR and claims databases to study the relationship between health events and various potential risk factors.

Keywords

TreeScan

sequential



disease surveillance

hierarchical testing

hypotheses 

Main Sponsor

Section on Statistical Computing