IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i1d10.1023_a1009889601723.html
   My bibliography  Save this article

Medical Surveillance, Frequent Sets, and Closure Operations

Author

Listed:
  • Alan P. Sprague

    (University of Alabama at Birmingham)

  • Stephen E. Brossette

    (University of Alabama at Birmingham)

Abstract

Surveillance of hospital-acquired infections, especially those caused by antibiotic resistant bacteria, is an important component of hospital infection control. A computer program for this purpose experienced a combinatorial computational explosion in time and space when processing data describing certain multi-drug resistant organisms. The blowup occurred while the program was generating frequent sets, a common phase in data mining algorithms. We present a modified algorithm for computing frequent sets that more efficiently handles the computational burden. The algorithm's proof of correctness involves the concepts of closure, independent sets, and circuits in a space more general than a matroid. Of central concern in the theory are inferences about a closure operation that can be obtained from limited information about the circuits.

Suggested Citation

  • Alan P. Sprague & Stephen E. Brossette, 2001. "Medical Surveillance, Frequent Sets, and Closure Operations," Journal of Combinatorial Optimization, Springer, vol. 5(1), pages 81-94, March.
  • Handle: RePEc:spr:jcomop:v:5:y:2001:i:1:d:10.1023_a:1009889601723
    DOI: 10.1023/A:1009889601723
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009889601723
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1009889601723?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:5:y:2001:i:1:d:10.1023_a:1009889601723. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.