IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0004168.html
   My bibliography  Save this article

Predicting the Herd Immunity Threshold during an Outbreak: A Recursive Approach

Author

Listed:
  • Nathan T Georgette

Abstract

Background: The objective was to develop a novel algorithm that can predict, based on field survey data, the minimum vaccination coverage required to reduce the mean number of infections per infectious individual to less than one (the Outbreak Response Immunization Threshold or ORIT) from up to six days in the advance. Methodology/Principal Findings: First, the relationship between the rate of immunization and the ORIT was analyzed to establish a link. This relationship served as the basis for the development of a recursive algorithm that predicts the ORIT using survey data from two consecutive days. The algorithm was tested using data from two actual measles outbreaks. The prediction day difference (PDD) was defined as the number of days between the second day of data input and the day of the prediction. The effects of different PDDs on the prediction error were analyzed, and it was found that a PDD of 5 minimized the error in the prediction. In addition, I developed a model demonstrating the relationship between changes in the vaccination coverage and changes in the individual reproduction number. Conclusions/Significance: The predictive algorithm for the ORIT generates a viable prediction of the minimum number of vaccines required to stop an outbreak in real time. With this knowledge, the outbreak control agency may plan to expend the lowest amount of funds required stop an outbreak, allowing the diversion of the funds saved to other areas of medical need.

Suggested Citation

  • Nathan T Georgette, 2009. "Predicting the Herd Immunity Threshold during an Outbreak: A Recursive Approach," PLOS ONE, Public Library of Science, vol. 4(1), pages 1-8, January.
  • Handle: RePEc:plo:pone00:0004168
    DOI: 10.1371/journal.pone.0004168
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0004168
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0004168&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0004168?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0004168. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.