Page 1 of 1

Exhibit 6. Demonstration that algorithm positives can be identified by compact logic

Exhibit 6. Demonstration that algorithm positives can be identified by compact logic. Go to Text Description below.

A, B, and C represent conditions. ~ is the NOT operator. n is the INTERSECTION operator and U is the UNION operator. SSI = surgical site infection.

Text Description

This exhibit diagrams the compact logic that allows an algorithm to identify positive and negative instances of surgical site infection, based on the stepwise relationship between three conditions (A, B, and C). Preceding a condition with a tilde negates the presence of that condition (e.g., ~A means "not condition A"). Union and intersection operators from set theory are used to relate the sets of cases with or without each condition in a logic tree. This is explained in the text paragraphs before and after the Exhibit.

Return to Document

Page last reviewed December 2012
Internet Citation: Exhibit 6. Demonstration that algorithm positives can be identified by compact logic. December 2012. Agency for Healthcare Research and Quality, Rockville, MD. http://www.ahrq.gov/research/findings/final-reports/ssi/ssiexh6.html