Christopher M. van Bommel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Christopher M. van Bommel has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Clow
Department of Mathematics Simon Fraser University Burnaby BC Canada
1 shared publication - Benjamin Benteke Longaou
University of Guelph, Guelph, Ontario, Canada
1 shared publication - David Lyver
University of Guelph
1 shared publication - Edward Wolfgang Thommes
Sanofi
1 shared publication - Monica-Gabriela Cojocaru
University of Guelph
1 shared publication - Pengfei Yue
University of Guelph
1 shared publication
Latest Publications
- Open Access
Expanding optimization ensemble model methods for forecasting seasonal influenza in the U.S.
Each year, the seasonal influenza epidemic sees significant variability in its evolution. Accurate forecasts of future influenza cases are important for planning public health responses. The United States Centers for Disease Control and Prevention (CDC) has annually organized the FluSight competition ( https://github.com/cdcepi/FluSight-forecast-hub ) to solicit forecasts from participating teams over horizons of 1, 2, and 3 weeks ahead. Using these data, the CDC produces an ensemble forecast of all submitted forecasts. In this paper, we introduce a new weight-based ensemble forecasting method to consider predicting laboratory-confirmed influenza hospital admissions for the 2024-2025 season. The method consists of determining optimal weights that are updated week-by-week throughout the FluSight competition to minimize the mean squared error (MSE) of a blend of teams’ previous forecasts compared to the truth data. Using these weights over an expanding time window starting at the beginning of the season (late Fall), we produce our own future forecasts; we call our method the expanding window optimization ensemble (EWO). To improve our method’s performance vis-a-vis the CDC ensemble model, we further introduce the Adjusted-Weights expanding window optimization ensemble (Adw-EWO) method. This new forecast is obtained by adding a correction term to the original EWO forecast, controlled by a parameter π ∈ (0, 1). We adaptively tune π to enhance forecasting performance of Adw-EWO vis-a-vis the CDC ensemble model. The correction term is computed using only the forecast errors at horizon 0 and is then applied uniformly across all forecast horizons. Our results show that the Adw-EWO method consistently outperforms the EWO across all horizons. Moreover, the Adw-EWO outperforms the CDC ensemble model at horizons 0, 1, and 2, while at horizon 3, the performance of Adw-EWO and the CDC ensemble was roughly comparable.
Open AccessExpanding optimization ensemble model methods for forecasting seasonal influenza in the U.S.
Each year, the seasonal influenza epidemic sees significant variability in its evolution. Accurate forecasts of future influenza cases are important for planning public health responses. The United States Centers for Disease Control and Prevention (CDC) has annually organized the FluSight competition ( https://github.com/cdcepi/FluSight-forecast-hub ) to solicit forecasts from participating teams over horizons of 1, 2, and 3 weeks ahead. Using these data, the CDC produces an ensemble forecast of all submitted forecasts. In this paper, we introduce a new weight-based ensemble forecasting method to consider predicting laboratory-confirmed influenza hospital admissions for the 2024-2025 season. The method consists of determining optimal weights that are updated week-by-week throughout the FluSight competition to minimize the mean squared error (MSE) of a blend of teams’ previous forecasts compared to the truth data. Using these weights over an expanding time window starting at the beginning of the season (late Fall), we produce our own future forecasts; we call our method the expanding window optimization ensemble (EWO). To improve our method’s performance vis-a-vis the CDC ensemble model, we further introduce the Adjusted-Weights expanding window optimization ensemble (Adw-EWO) method. This new forecast is obtained by adding a correction term to the original EWO forecast, controlled by a parameter π ∈ (0, 1). We adaptively tune π to enhance forecasting performance of Adw-EWO vis-a-vis the CDC ensemble model. The correction term is computed using only the forecast errors at horizon 0 and is then applied uniformly across all forecast horizons. Our results show that the Adw-EWO method consistently outperforms the EWO across all horizons. Moreover, the Adw-EWO outperforms the CDC ensemble model at horizons 0, 1, and 2, while at horizon 3, the performance of Adw-EWO and the CDC ensemble was roughly comparable.
- Open Access
Eternal Distance-2 Domination in Trees
We consider the eternal distance-2 domination problem, recently proposed by Cox, Meger, and Messinger, on trees. We show that finding a minimum eternal distance-2 dominating set of a tree is linear time in the order of the graph by providing a fast algorithm. Additionally, we characterise when trees have an eternal distance-2 domination number equal to their domination number or their distance-2 domination number, along with characterizing which trees are eternal distance-2 domination critical. We conclude by providing general upper and lower bounds for the eternal distance-k domination number of a graph, as well as constructing an infinite family of trees which meet said upper bound and another which meets the given lower bound.
Open AccessEternal Distance-2 Domination in Trees
We consider the eternal distance-2 domination problem, recently proposed by Cox, Meger, and Messinger, on trees. We show that finding a minimum eternal distance-2 dominating set of a tree is linear time in the order of the graph by providing a fast algorithm. Additionally, we characterise when trees have an eternal distance-2 domination number equal to their domination number or their distance-2 domination number, along with characterizing which trees are eternal distance-2 domination critical. We conclude by providing general upper and lower bounds for the eternal distance-k domination number of a graph, as well as constructing an infinite family of trees which meet said upper bound and another which meets the given lower bound.