Adaptive Change-Point Detection
Author Information
Author(s): Yinglei Lai
Primary Institution: The George Washington University
Hypothesis
Can we partition a variable into consecutive non-overlapped intervals such that the risks are similar within an interval but significantly different between two adjacent intervals?
Conclusion
The proposed modified dynamic programming algorithm provides consistent estimation results and outperforms traditional methods in detecting multiple change-points.
Supporting Evidence
- The modified dynamic programming algorithm provides consistent estimates for population means.
- The method shows improved performance compared to traditional recursive combination/partition procedures.
- Cross-validation procedures were used to determine optimal parameters.
Takeaway
This study helps doctors understand how different factors like age and BMI affect diabetes risk by breaking down data into smaller, clearer parts.
Methodology
A modified dynamic programming algorithm was used to partition time-course data into intervals with significantly different population means.
Limitations
A relatively large sample size is required to achieve satisfactory detection power.
Statistical Information
P-Value
0.00001
Statistical Significance
p<0.05
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website