Completing the Results of the 2013 Boston Marathon

DSpace/Manakin Repository

Completing the Results of the 2013 Boston Marathon

Citable link to this page

 

 
Title: Completing the Results of the 2013 Boston Marathon
Author: Hammerling, Dorit; Cefalu, Matthew; Cisewski, Jessi; Dominici, Francesca; Parmigiani, Giovanni; Paulson, Charles; Smith, Richard L.

Note: Order does not necessarily reflect citation order of authors.

Citation: Hammerling, Dorit, Matthew Cefalu, Jessi Cisewski, Francesca Dominici, Giovanni Parmigiani, Charles Paulson, and Richard L. Smith. 2014. “Completing the Results of the 2013 Boston Marathon.” PLoS ONE 9 (4): e93800. doi:10.1371/journal.pone.0093800. http://dx.doi.org/10.1371/journal.pone.0093800.
Full Text & Related Files:
Abstract: The 2013 Boston marathon was disrupted by two bombs placed near the finish line. The bombs resulted in three deaths and several hundred injuries. Of lesser concern, in the immediate aftermath, was the fact that nearly 6,000 runners failed to finish the race. We were approached by the marathon's organizers, the Boston Athletic Association (BAA), and asked to recommend a procedure for projecting finish times for the runners who could not complete the race. With assistance from the BAA, we created a dataset consisting of all the runners in the 2013 race who reached the halfway point but failed to finish, as well as all runners from the 2010 and 2011 Boston marathons. The data consist of split times from each of the 5 km sections of the course, as well as the final 2.2 km (from 40 km to the finish). The statistical objective is to predict the missing split times for the runners who failed to finish in 2013. We set this problem in the context of the matrix completion problem, examples of which include imputing missing data in DNA microarray experiments, and the Netflix prize problem. We propose five prediction methods and create a validation dataset to measure their performance by mean squared error and other measures. The best method used local regression based on a K-nearest-neighbors algorithm (KNN method), though several other methods produced results of similar quality. We show how the results were used to create projected times for the 2013 runners and discuss potential for future application of the same methodology. We present the whole project as an example of reproducible research, in that we are able to make the full data and all the algorithms we have used publicly available, which may facilitate future research extending the methods or proposing completely different approaches.
Published Version: doi:10.1371/journal.pone.0093800
Other Sources: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3984103/pdf/
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:12152873
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters