Cohort-based prediction of a future event

Information

  • Patent Grant
  • 10318877
  • Patent Number
    10,318,877
  • Date Filed
    Tuesday, October 18, 2011
    13 years ago
  • Date Issued
    Tuesday, June 11, 2019
    5 years ago
  • CPC
  • Field of Search
    • US
    • 705 003000
    • 705 002000
    • CPC
    • G16H50/20
    • G16H50/50
    • G16H50/70
    • G06F19/324
    • G06F19/3418
  • International Classifications
    • G06N7/00
    • Term Extension
      960
Abstract
A processor-implemented method, computer program product, and/or computer system predicts a future event. A first bit array, which describes characteristics of a single entity while experiencing a first event, is generated using values received from a set of physical test devices. After the first single entity experiences a different second event, a second bit array is generated from another set of physical test devices. The second bit array describes characteristics of an event cohort, which is made up of entities, other than the single entity, which also experience the second event, but which never experienced the first event. When another single entity experiences the first event, a determination is made as to whether that other single entity has characteristics from both the first bit array and the second bit array. If so, a prediction is made that the other single entity will also experience the second event.
Description
BACKGROUND

The present disclosure relates to the field of computers, and specifically to the use of computers in event monitoring. Still more particularly, the present disclosure relates to the use of computers in utilizing cohorts to predict that a single entity will experience a particular future event.


A bit array is defined as an array structure that stores individual bits. Each individual bit can be associated with a particular characteristic or condition. For example, a particular bit in a bit array can be used to describe whether a particular entity described by the bit array has a particular disease, has purchased a particular product, has taken a particular medical test, etc. These values/characteristics/conditions can be accessed using a bit array index (also called a bitmap index), which associates a specific characteristic/condition to a specific bit location in the bit array.


SUMMARY

A processor-implemented method, computer program product, and/or computer system predicts an occurrence of a future event. A first bit array, which describes characteristics of a single entity while experiencing a first event, is generated using values received from a set of physical test devices. After the first single entity experiences a different second event, a second bit array is generated from another set of physical test devices. The second bit array describes characteristics of an event cohort, which is made up of entities, other than the single entity, which also experience the second event, but which never experienced the first event. When another single entity experiences the first event, a determination is made as to whether that other single entity has characteristics from both the first bit array and the second bit array. If so, a prediction is made that the other single entity will also experience the second event.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS


FIG. 1 depicts an exemplary computer in which the present disclosure may be implemented;



FIG. 2 is a high level flow chart of one or more exemplary steps taken by a processor to predict an occurrence of future event; and



FIG. 3 depicts a relationship among entities, test devices, and bit arrays.





DETAILED DESCRIPTION

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.


Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.


A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.


Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including, but not limited to, wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.


Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).


Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.


These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.


The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.


With reference now to the figures, and in particular to FIG. 1, there is depicted a block diagram of an exemplary computer 102, which may be utilized by the present invention. Note that some or all of the exemplary architecture, including both depicted hardware and software, shown for and within computer 102 may be utilized by software deploying server 150, health care database providers' computer(s) 152, and/or physical test device(s) 154.


Computer 102 includes a processor 104 that is coupled to a system bus 106. Processor 104 may utilize one or more processors, each of which has one or more processor cores. A video adapter 108, which drives/supports a display 110, is also coupled to system bus 106. System bus 106 is coupled via a bus bridge 112 to an input/output (I/O) bus 114. An I/O interface 116 is coupled to I/O bus 114. I/O interface 116 affords communication with various I/O devices, including a keyboard 118, a mouse 120, a media tray 122 (which may include storage devices such as CD-ROM drives, multi-media interfaces, etc.), a printer 124, and external USB port(s) 126. While the format of the ports connected to I/O interface 116 may be any known to those skilled in the art of computer architecture, in one embodiment some or all of these ports are universal serial bus (USB) ports.


As depicted, computer 102 is able to communicate with a software deploying server 150 using a network interface 130. Network 128 may be an external network such as the Internet, or an internal network such as an Ethernet or a virtual private network (VPN).


A hard drive interface 132 is also coupled to system bus 106. Hard drive interface 132 interfaces with a hard drive 134. In one embodiment, hard drive 134 populates a system memory 136, which is also coupled to system bus 106. System memory is defined as a lowest level of volatile memory in computer 102. This volatile memory includes additional higher levels of volatile memory (not shown), including, but not limited to, cache memory, registers and buffers. Data that populates system memory 136 includes computer 102's operating system (OS) 138 and application programs 144.


OS 138 includes a shell 140, for providing transparent user access to resources such as application programs 144. Generally, shell 140 is a program that provides an interpreter and an interface between the user and the operating system. More specifically, shell 140 executes commands that are entered into a command line user interface or from a file. Thus, shell 140, also called a command processor, is generally the highest level of the operating system software hierarchy and serves as a command interpreter. The shell provides a system prompt, interprets commands entered by keyboard, mouse, or other user input media, and sends the interpreted command(s) to the appropriate lower levels of the operating system (e.g., a kernel 142) for processing. Note that while shell 140 is a text-based, line-oriented user interface, the present invention will equally well support other user interface modes, such as graphical, voice, gestural, etc.


As depicted, OS 138 also includes kernel 142, which includes lower levels of functionality for OS 138, including providing essential services required by other parts of OS 138 and application programs 144, including memory management, process and task management, disk management, and mouse and keyboard management.


Application programs 144 include a renderer, shown in exemplary manner as a browser 146. Browser 146 includes program modules and instructions enabling a world wide web (WWW) client (i.e., computer 102) to send and receive network messages to the Internet using hypertext transfer protocol (HTTP) messaging, thus enabling communication with software deploying server 150 and other computer systems.


Application programs 144 in computer 102's system memory (as well as software deploying server 150's system memory) also include a cohort-based event prediction program (CBEPP) 148. CBEPP 148 includes code for implementing the processes described below, including those described in FIG. 2. In one embodiment, computer 102 is able to download CBEPP 148 from software deploying server 150, including in an on-demand basis, wherein the code in CBEPP 148 is not downloaded until needed for execution. Note further that, in one embodiment of the present invention, software deploying server 150 performs all of the functions associated with the present invention (including execution of CBEPP 148), thus freeing computer 102 from having to use its own internal computing resources to execute CBEPP 148.


The hardware elements depicted in computer 102 are not intended to be exhaustive, but rather are representative to highlight essential components required by the present invention. For instance, computer 102 may include alternate memory storage devices such as magnetic cassettes, digital versatile disks (DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present invention.


Referring now to FIG. 2, a high level flow chart of one or more exemplary steps taken by a processor to predict an occurrence of future event is presented. After initiator block 202, a processor generates a first bit array, as described in block 204. This first bit array comprises a first set of values that describes a first set of characteristics of a first single entity when said first single entity is experiencing a first event. For example, assume that a cancer patient is receiving chemotherapy. As represented in FIG. 3, in this example the cancer patient is the first single entity 302, and receiving the chemotherapy is the first event. The first bit array 304 is specific for this first single entity 302 (the cancer patient), and holds bits that describe outputs 306 from a specific set of physical test devices, such as a gene analyzer (e.g., equipment that identifies particular genes using a microarray machine using bacterial/protein binding), a computed tomography (CT) scanner (which produces a visualization of a structure), a blood analyzer (e.g., equipment that automatically detects/determines oxygen saturation level, blood cell anomalies, etc. in blood or serum), etc. Note that, in this example, the output 306 (e.g., test results) from this specific set of physical test devices is unaffected by the medical treatment (i.e., chemotherapy). As such, the processor will select the specific set of physical test devices (i.e., the gene analyzer, the CT scanner, and the blood analyzer) as the first set of physical test devices 308, since the first set of characteristics (described by these devices' outputs) do not cause the first event. That is, even though the CT scanner may recognize a cancerous tumor, having this tumor is not the first event in one embodiment. Rather, it is the taking of the chemotherapy that is the first event in this embodiment. In another embodiment, however, having the medical condition (i.e., having the tumor) is the first event. Note that in either embodiment (in which the event is either 1) the medical condition or 2) the treatment of the medical condition), the first set of physical test devices 308 do not generate data that describes the first event itself. Similarly, the first event does not directly cause the characteristics that are measured/detected by the first set of physical test devices 308. Thus, the data generated by the first set of physical test devices 308 does not describe, nor is it the result of, the first event.


With reference now to query block 206 in FIG. 2, a determination is made that the first single entity has experienced a second event subsequent to the first event. Continuing with the patient example above, this second event may be a heart attack. Thus, the processor, by accessing the health care database providers' computer(s) 152 (shown in FIG. 1) can identify that the first event was taking the chemotherapy (medical treatment) and that the second event was the heart attack.


As described in block 208, the processor then generates a second bit array. As depicted in the example shown in FIG. 3, this second bit array 310 contains a set of values that identifies a set of characteristics of an event cohort 312. This event cohort 312 is made up of other entities (e.g., other patients) that have also experienced the second event (a heart attack in this example). Note, however, that members of this event cohort (i.e., the multiple other entities) never experienced the first event (taking chemotherapy). Note also that the set of values that populate the second bit array represent the output 314 of a second set of physical test devices 316, which is functionally different from the first set of physical test devices 308. For example, while the first set of physical devices 308 may be a gene analyzer, a CT scanner, and a blood analyzer, the second set of physical devices 316 may be an audiometer, an electroencephalograph (EEG) machine that traces brainwaves, a body-core thermometer (e.g., a swallow-able thermometer that can be externally read to monitor a patient's core body temperature), etc. Note that one or more of the physical test devices (308 or 316) may be non-medical test devices, such as a pedometer (to measure how far a person has walked), a radio frequency identifier (RFID) or global positioning system (GPS) based personal location monitor, etc. Note that the second set of characteristics alone do not cause the second event. For example, characteristics measured by the EEG machine and thermometer do not cause a heart attack. Note also that no shared common characteristics are represented in both the first bit array 304 and the second bit array 310 (as emphasized by the first bit array 304 containing 1s and 0s, while the second bit array 310 contains a's and b's). That is, in the example described, only results of the gene analyzer, the CT scanner, and the blood analyzer are represented in the first bit array 304, while only audiometric, EEG and thermometer readings are represented in the second bit array 310.


Note that in one embodiment, the processor time shifts the second bit array before the second event to form a time-shifted second bit array. That is, rather than taking readings from the second set of physical test devices at the time of the second event (e.g., the heart attack), previously stored readings from the second set of physical test devices, which were taken before the heart attack, are retrieved (i.e., before some predetermined length of time before the second event). Thus, this time-shifted second bit array represents characteristics that are associated with the event cohort before the second event occurs.


In one embodiment, the processor time shifts the second bit array after the second event to form a time-shifted second bit array. That is, rather than taking readings from the second set of physical test devices at the time of the second event (e.g., the heart attack), the processor waits some predetermined length of time after the second event (e.g., the heart attack) and then retrieves readings from the second set of physical test devices. Thus, this time-shifted second bit array represents characteristics that are associated with the event cohort after the second event occurs. By time shifting the second bit array before and/or after the second event, new correlations between the second event and time-varied readings from the second set of physical test devices are made, thus leading to refined/revised hypotheses regarding the cause of the second event, particularly when viewed in the context of the first event's presence or absence.


In one embodiment, the processor identifies an event characteristic that is associated with a third event. The third event occurs contemporaneously with the second event. However, the third event has been predetermined to be unrelated to the second event. For example, assume that the second bit array for the event cohort includes bits that represent one of the characteristics of a person/entity experiencing the second event (e.g., a heart attack in the example presented herein). However, the processor may determine that these characteristics were actually caused by an unrelated event, such as having a chest cold. In order to “clean up” the second bit array, the processor removes any bit from the second bit array that describes the event characteristic that is associated with only the third event.


With reference now to block 210 in FIG. 2, the processor then receives a third bit array that describes characteristics of a second single entity (i.e., another patient in the example given above, as represented in FIG. 3 as the second single entity 318) that is experiencing the first event (i.e., taking the chemotherapy, as described in the example above). As described in query block 212 of FIG. 2, a determination is then made as to whether this third bit array includes values (representing particular characteristics of this second single entity) that are found in both the first bit array and the second bit array. Note that the first bit array and the second bit array hold values that are mutually exclusive, since they represent outputs from functionally different test devices. Nonetheless, if a patient has characteristics represented by both the first bit array and the second bit array, then a predication is made that this patient will also experience the second event (e.g., will suffer a heart attack) at a future time (block 214). Thus, the present system/process combines current states (i.e., characteristics/outputs associated with the first event) with future states (i.e., characteristics/outputs associated with the second event) to create a hybrid bit array, which can predict that the second event will occur, or at least provides a new hypothesis regarding the cause of the second event.


The third bit array described in query block 212, and resulting in the activity described in block 214, includes values from both the first and second bit arrays. Thus, in the exemplary embodiment depicted in FIG. 3, the third bit array 320 is generated from output 322 from the first set of physical test devices 308 and the output 324 from the second set of physical test devices 316. In the example shown in FIG. 3, the values found in the third bit array 320 are exactly the same as those found in the first bit array 304 and the second bit array 310. In another embodiment, however, the third bit array 320 contains some predetermined percentage of bit values found in the first bit array 304 and the second bit array 310. For example, if there is an 80% match between the first bit array 304 and the top row of the third bit array 320, and/or there is a 90% match between the second bit array 310 and the bottom row of the third bit array 320, this matching level is deemed adequate to support the prediction/hypothesis described herein that the second single entity 318 will experience the second event in the future.


In one embodiment, the level of matching provides a likelihood that the second event will occur. For example, a 90% match between the third bit array 320 with the first bit array 304 and the second bit array 314 makes the likelihood of the second single entity experiencing the second event more likely than if there were only an 80% match.


In one embodiment, the level of matching provides a time frame in which the second event will likely occur. For example, assume that the first single entity experienced the second event one year after he experienced the first event. A 100% match between the third bit array 320 with the first bit array 304 and the second bit array 314 makes it likely that the second single entity 318 will experience the second event within a year. Alternatively, a 90% match makes it likely that the second event will occur within two years, while an 80% match makes it likely that the second event will occur with five years. These likelihoods (both event and temporal) are based on the combined similarity between the second single entity 318 and the first single entity 302 and the event cohort 312. These likelihoods begin as hypotheses, which can later be confirmed with case studies.


Returning to FIG. 2, the process ends at terminator block 216.


Note that in one embodiment, the processor has determined that the first event and the second event are different types of events (e.g., the first event is the receipt of pharmaceutical treatments and the second event is a heart attack). Nonetheless, in this embodiment the processor establishes a relationship between the first event and the second event through use of a Bayesian algorithm, which establishes a correlation between the first event and the second event based on common entities that experience the first event and the second event. This relationship is then used to bolster (reinforce) the hypothesis/prediction that the second single entity will experience the second event, as described above.


In an exemplary Bayesian analysis, assume that H represents the hypothesis that the second single entity will have a same increased chance of having a heart attack as the first single entity, and D represents that the second single entity has the same attributes (depicted in the first bit array) as the first single entity. This results in the Bayesian probability formula of:







P


(

H

D

)


=



P


(

D

H

)


*

P


(
H
)




P


(
D
)








where:


P(H|D) is the probability that a second single entity will have an increased likelihood of experiencing a heart attack (H) given that (I) the second single entity has the same attributes (both medical and non-medical) as the first single entity (D);


P(D|H) is the probability that, if the second single entity has an increased chance of having a heart attack, the second single entity will have the same attributes as the first single entity (i.e., even if the hypothesis P(H|D) is true, the two single entities may not have the exact same attributes);


P(H) is the probability that the second single entity will have an increased likelihood of having a heart attack regardless of any other information/facts; and


P(D) is the probability that the second single entity will have the same non-linear attributes as the first single entity regardless of any other information/facts.


For example, assume that past studies about entities similar to the first and second single entities show that any entity (patient) will have a higher heart attack rate relative to the group of unrelated patients 50% of the time (P(H)=50%). Assume further that the measured/deduced odds of two single entities having the same attributes (both medical and non-medical) are 6 out of 10 (P(D)=60%). Finally, assume that past studies have shown that two single entities having the same increased heart attack levels will have all of the same shared attributes 80% of the time (P(D|H)=80%). According to these values, the probability that the second single entity will have an increased likelihood of having a heart attack is therefore 66%:







P


(

H

D

)


=



.80
*
.50

.60

=
.66





However, if past studies have shown that two similar entities having the same increased likelihood of having a heart attack have all of the same shared attributes (i.e., the first bit array is the same for both the first and second entities) 100% of the time (P(D|H)=100%), then the probability that the second single entity will have an increased level of cancer is now 83%:







P


(

H

D

)


=



1.0
*
.50

.60

=
.83





Note that in one embodiment, the first event may be a first medical diagnosis (e.g., diagnosing the patient as having cancer), while the second event may be a second medical diagnosis (e.g., diagnosing the patient as having heart disease). The same processes described herein are used to predict that a second single entity (as described above) will also be diagnosed with a heart disease, assuming that the bit array values described herein are in line with the process/examples presented above.


As described herein, one embodiment of the present invention refines the predictive power of the first bit array (when associated with a first event) with the correlation power of the second bit array (when associated with a second event). This refinement not only creates a more accurate prediction of whether the second event will occur, but also creates previously undeveloped hypotheses regarding the relationship and/or causation of the second event with respect to the first event.


The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.


The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.


The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of various embodiments of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.


Note further that any methods described in the present disclosure may be implemented through the use of a VHDL (VHSIC Hardware Description Language) program and a VHDL chip. VHDL is an exemplary design-entry language for Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), and other similar electronic devices. Thus, any software-implemented method described herein may be emulated by a hardware-based VHDL program, which is then applied to a VHDL chip, such as a FPGA.


Having thus described embodiments of the invention of the present application in detail and by reference to illustrative embodiments thereof, it will be apparent that modifications and variations are possible without departing from the scope of the invention defined in the appended claims.

Claims
  • 1. A method comprising: a processor generating a first bit array, wherein the first bit array comprises a first set of values that describes a first set of characteristics of a first single entity when said first single entity experiences a first event, wherein the processor receives the first set of values as electronic signals from a first set of physical test devices, wherein the first set of characteristics do not cause the first event, wherein the first set of values generated by the physical test devices does not describe the first event, and wherein the first set of values is not a result of the first event;the processor generating a second bit array, wherein the second bit array comprises a second set of values that identifies a second set of characteristics of an event cohort, wherein the event cohort is made up of multiple other entities that experience a second event, wherein the second event includes a medical condition, wherein the multiple other entities never experienced the first event, wherein the processor receives the second set of values from a second set of physical test devices that is functionally different from the first set of physical test devices, wherein the second set of characteristics alone do not cause the medical condition, and wherein no shared common characteristics are represented in both the first bit array and the second bit array;the processor receiving a third bit array that describes characteristics of a second single entity that is experiencing the first event;the processor determining that the third bit array comprises values from the first bit array and the second bit array;the processor determining a percentage of bits from the third bit array that match bits from the first bit array and the second bit array;in response to the processor determining that the percentage is at a first predefined level, the processor predicting that the second single entity will experience the medical condition at a first future time;in response to the processor determining that the percentage is at a second predefined level, the processor predicting that the second single entity will experience the medical condition at a second future time, wherein the first predefined level is greater than the second predefined level, and wherein the first future time is reached before the second future time; andin response to the processor determining that the percentage is at the second predefined level, administering a medical pharmaceutical treatment for the medical condition to the second single entity at the first future time, wherein the second event further comprises administering the medical pharmaceutical treatment to the second single entity for the medical condition.
  • 2. The method of claim 1, further comprising: the processor time shifting the second bit array before the second event to form a time-shifted second bit array, wherein the time-shifted second bit array represents characteristics that are associated with the event cohort before the second event occurs.
  • 3. The method of claim 1, further comprising: the processor time shifting the second bit array after the second event to form a time-shifted second bit array, wherein the time-shifted second bit array represents characteristics that are associated with the event cohort after the second event occurs.
  • 4. The method of claim 1, further comprising: the processor determining that outputs from a specific set of physical test devices are unaffected by the medical pharmaceutical treatment; andthe processor selecting the specific set of physical test devices as the first set of physical test devices.
  • 5. The method of claim 1, further comprising: the processor identifying an event characteristic that is associated with a third event, wherein the third event has been predetermined to be unrelated to the second event, and wherein the third event occurs contemporaneously with the second event; andthe processor removing any bit from the second bit array that describes the event characteristic that is associated with the third event.
  • 6. The method of claim 1, further comprising: the processor determining that the first event and the second event are different types of events; andthe processor establishing a relationship between the first event and the second event through use of a Bayesian algorithm that establishes a correlation between the first event and the second event based on common entities that experience the first event and the second event.
  • 7. The method of claim 1, further comprising: the processor determining that the third bit array comprises all values from the first bit array and all values from the second bit array; andthe processor predicting, based on the third bit array comprising all values from the first bit array and all values from the second bit array, that the second single entity will experience the second event at the first future time.
  • 8. A method comprising: a processor generating a first bit array, wherein the first bit array comprises a first set of values that describes a first set of characteristics of a first single entity when said first single entity experiences a first event, wherein the processor receives the first set of values as electronic signals from a first set of physical test devices, wherein the first set of characteristics do not cause the first event, wherein the first event is a medical pharmaceutical treatment, wherein the first set of values generated by the physical test devices does not describe the first event, and wherein the first set of values is not a result of the first event;the processor determining that outputs from a specific set of physical test devices are unaffected by the medical pharmaceutical treatment;the processor selecting the specific set of physical test devices as the first set of physical test devices;the processor generating a second bit array, wherein the second bit array comprises a second set of values that identifies a second set of characteristics of an event cohort, wherein the event cohort is made up of multiple other entities that experience a second event, wherein the second event comprises a medical condition, wherein the multiple other entities never experienced the first event, wherein the processor receives the second set of values from a second set of physical test devices that is functionally different from the first set of physical test devices, wherein the second set of characteristics alone do not cause the second event, and wherein no shared common characteristics are represented in both the first bit array and the second bit array;the processor receiving a third bit array that describes characteristics of a second single entity that is experiencing the first event;the processor determining that the third bit array comprises values from the first bit array and the second bit array; andin response to the processor determining that the third bit array comprises values from the first bit array and the second bit array, administering a medical pharmaceutical treatment to the second single entity for the medical condition, wherein the second event further comprises the medical pharmaceutical treatment for the medical condition.
  • 9. A method comprising: a processor generating a first bit array, wherein the first bit array comprises a first set of values that describes a first set of characteristics of a first single entity when said first single entity experiences a first event, wherein the processor receives the first set of values as electronic signals from a first set of physical test devices, wherein the first set of characteristics do not cause the first event, wherein the first event is a medical treatment, wherein the first set of values generated by the physical test devices does not describe the first event, and wherein the first set of values is not a result of the first event;the processor generating a second bit array, wherein the second bit array comprises a second set of values that identifies a second set of characteristics of an event cohort, wherein the event cohort is made up of multiple other entities that experience a second event, wherein the second event comprises a medical condition, wherein the multiple other entities never experienced the first event, wherein the processor receives the second set of values from a second set of physical test devices that is functionally different from the first set of physical test devices, wherein the second set of characteristics alone do not cause the second event, and wherein no shared common characteristics are represented in both the first bit array and the second bit array;the processor identifying an event characteristic that is associated with a third event, wherein the third event has been predetermined to be unrelated to the second event, and wherein the third event occurs contemporaneously with the second event; andthe processor removing any bit from the second bit array that describes the event characteristic that is associated with the third event;the processor receiving a third bit array that describes characteristics of a second single entity that is experiencing the first event;the processor determining that the third bit array comprises values from the first bit array and the second bit array; andin response to the processor determining that the third bit array comprises values from the first bit array and the second bit array, administering a pharmaceutical treatment to the second single entity for the medical condition, wherein the second event further comprises the pharmaceutical treatment for the medical condition.
US Referenced Citations (332)
Number Name Date Kind
4328978 McLaughlin May 1982 A
4551842 Segarra Dec 1985 A
4742388 Cooper et al. May 1988 A
4841526 Wilson et al. Jun 1989 A
4890227 Watanabe et al. Dec 1989 A
5036462 Kaufman et al. Jul 1991 A
5070453 Duffany Dec 1991 A
5128871 Schmitz Jul 1992 A
5237429 Zuiss et al. Aug 1993 A
5406626 Ryan Apr 1995 A
5455868 Sergent et al. Oct 1995 A
5524051 Ryan Jun 1996 A
5550021 Blum et al. Aug 1996 A
5491838 Takahisa Nov 1996 A
5577266 Takahisa et al. Nov 1996 A
5590195 Ryan Dec 1996 A
5613194 Olds et al. Mar 1997 A
5642397 Agbaje-Anozie Jun 1997 A
5659596 Dunn Aug 1997 A
5664109 Johnson et al. Sep 1997 A
5692446 Becker et al. Dec 1997 A
5692501 Minturn Dec 1997 A
5745532 Campana, Jr. Apr 1998 A
5751806 Ryan May 1998 A
5764740 Holender Jun 1998 A
5774569 Waldenmaier Jun 1998 A
5781704 Rossmo Jul 1998 A
5809472 Morrison Sep 1998 A
5815971 Rothe et al. Oct 1998 A
5825755 Thompson et al. Oct 1998 A
5838918 Prager et al. Nov 1998 A
5880598 Duong Mar 1999 A
5889474 Ladue Mar 1999 A
5911132 Sloane Jun 1999 A
5926624 Katz et al. Jul 1999 A
5930350 Johnson Jul 1999 A
5965352 Stoughton et al. Oct 1999 A
5967981 Watrous Oct 1999 A
5974312 Hayes, Jr. et al. Oct 1999 A
5982281 Layson, Jr. Nov 1999 A
6021403 Horvitz et al. Feb 2000 A
6054928 Lemelson et al. Apr 2000 A
6058391 Gardner May 2000 A
6076166 Moshfeghi et al. Jun 2000 A
6119096 Mann et al. Sep 2000 A
6167405 Rosensteel et al. Dec 2000 A
6178141 Duckworth et al. Jan 2001 B1
6189004 Rassen et al. Feb 2001 B1
6192340 Abecassis Feb 2001 B1
6212524 Weissman et al. Apr 2001 B1
6216134 Heckerman et al. Apr 2001 B1
6242186 Salonen Jun 2001 B1
6269365 Kiyoki et al. Jul 2001 B1
6278999 Knapp Aug 2001 B1
6285886 Kamel et al. Sep 2001 B1
6321207 Ye Nov 2001 B1
6353818 Carino, Jr. Mar 2002 B1
6370931 Bennett Apr 2002 B2
6377993 Brandt et al. Apr 2002 B1
6385604 Bakalash et al. May 2002 B1
6484155 Kiss et al. Nov 2002 B1
6506384 Laal et al. Jan 2003 B1
6509898 Chi et al. Jan 2003 B2
6553336 Johnson et al. Apr 2003 B1
6563804 Iyer et al. May 2003 B1
6578043 Nye Jun 2003 B2
6581037 Pak Jun 2003 B1
6606625 Muslea et al. Aug 2003 B1
6629106 Narayanaswamy et al. Sep 2003 B1
6646676 Dagraca et al. Nov 2003 B1
6662141 Kaub Dec 2003 B2
6675159 Lin et al. Jan 2004 B1
6714979 Brandt et al. Mar 2004 B1
6795808 Strubbe et al. Sep 2004 B1
6823818 Van Den Berg et al. Nov 2004 B2
6826568 Bernstein et al. Nov 2004 B2
6829604 Tifft Dec 2004 B1
6905816 Jacobs et al. Jun 2005 B2
6937147 Dilbeck et al. Aug 2005 B2
6941311 Shah et al. Sep 2005 B2
6954736 Menninger et al. Oct 2005 B2
6963826 Hanaman et al. Nov 2005 B2
6965816 Walker Nov 2005 B2
6972687 Marshall et al. Dec 2005 B1
6978268 Thomas et al. Dec 2005 B2
6996567 Ghukasyan Feb 2006 B2
7019740 Georgalas Mar 2006 B2
7047253 Murthy et al. May 2006 B1
7072794 Wittkowski Jul 2006 B2
7080081 Agarwal et al. Jul 2006 B2
7089250 Dognata et al. Aug 2006 B2
7111010 Chen Sep 2006 B2
7113993 Cappiello et al. Sep 2006 B1
7152070 Musick et al. Dec 2006 B1
7179645 Humphreys et al. Feb 2007 B2
7181428 Lawrence Feb 2007 B2
7191183 Goldstein Mar 2007 B1
7213009 Pestotnik et al. May 2007 B2
7230930 Ahya et al. Jun 2007 B2
7240330 Fairweather Jul 2007 B2
7295925 Breed et al. Nov 2007 B2
7308385 Wegerich et al. Dec 2007 B2
7337146 Heelan et al. Feb 2008 B2
7346492 Shaw Mar 2008 B2
7363309 Waite et al. Apr 2008 B1
7403922 Lewis et al. Jul 2008 B1
7433853 Brockway et al. Oct 2008 B2
7457731 Rao Nov 2008 B2
7457810 Breining et al. Nov 2008 B2
7500150 Sharma et al. Mar 2009 B2
7516142 Friedlander et al. Apr 2009 B2
7523118 Friedlander et al. Apr 2009 B2
7526467 Fogel Apr 2009 B2
7533113 Haddad May 2009 B1
7538658 Twitchell May 2009 B2
7543149 Ricciardi et al. Jun 2009 B2
7548874 Kanevsky et al. Jun 2009 B2
7580922 Friedlander et al. Aug 2009 B2
7630330 Friedlander et al. Aug 2009 B2
7584160 Friedlander et al. Sep 2009 B2
7584280 Kim et al. Sep 2009 B2
7606772 Flinn et al. Oct 2009 B2
7630948 Friedlander et al. Dec 2009 B2
7631222 Hasan et al. Dec 2009 B2
7634109 Steinberg et al. Dec 2009 B2
7647286 Friedlander et al. Jan 2010 B2
7647288 Friedlander et al. Jan 2010 B2
7653609 Friedlander et al. Jan 2010 B2
7667596 Ozdemir et al. Feb 2010 B2
7676390 Senturk et al. Mar 2010 B2
7683929 Elazar et al. Mar 2010 B2
7685083 Fairweather Mar 2010 B2
7693766 Horowitz Apr 2010 B2
7698246 Friedlander et al. Apr 2010 B2
7702605 Friedlander et al. Apr 2010 B2
7755480 Aritsuka et al. Jul 2010 B2
7761440 Chow et al. Jul 2010 B2
7779051 Friedlander et al. Aug 2010 B2
7788213 Friedlander et al. Aug 2010 B2
7792783 Friedlander et al. Sep 2010 B2
7805391 Friedlander et al. Sep 2010 B2
7809660 Friedlander et al. Oct 2010 B2
7840515 Ozdemir et al. Nov 2010 B2
7840897 Ancier Nov 2010 B2
7846020 Walker et al. Dec 2010 B2
7921036 Sharma et al. Apr 2011 B1
7930204 Sharma et al. Apr 2011 B1
7953686 Angell et al. May 2011 B2
7974869 Sharma et al. Jul 2011 B1
8000777 Jaeb et al. Aug 2011 B2
8041516 Angell et al. Oct 2011 B2
8117144 Angell et al. Feb 2012 B2
20010051881 Filler Dec 2001 A1
20020004782 Cincotta Jan 2002 A1
20020049772 Rienhoff et al. Apr 2002 A1
20020052756 Lomangino May 2002 A1
20020059183 Chen May 2002 A1
20020099691 Lore et al. Jul 2002 A1
20020099692 Shah et al. Jul 2002 A1
20020107641 Schaeffer et al. Aug 2002 A1
20020107824 Ahmed Aug 2002 A1
20020111922 Young et al. Aug 2002 A1
20020147617 Schoenbaum et al. Oct 2002 A1
20020156791 Nesamoney et al. Oct 2002 A1
20020176604 Shekhar et al. Nov 2002 A1
20020183971 Wegerich et al. Dec 2002 A1
20020184225 Ghukasyan Dec 2002 A1
20020184401 Kadel et al. Dec 2002 A1
20020194117 Nabe et al. Dec 2002 A1
20030014400 Siegel Jan 2003 A1
20030023612 Carlbom et al. Jan 2003 A1
20030033263 Cleary Feb 2003 A1
20030036903 Konopka et al. Feb 2003 A1
20030065535 Karlov Apr 2003 A1
20030074222 Rosow et al. Apr 2003 A1
20030088438 Maughan et al. May 2003 A1
20030088463 Kanevsky et al. May 2003 A1
20030126148 Gropper et al. Jul 2003 A1
20030131362 Jasinschi et al. Jul 2003 A1
20030140063 Pizzorno et al. Jul 2003 A1
20030169907 Edwards et al. Sep 2003 A1
20030171876 Markowitz et al. Sep 2003 A1
20030174773 Comaniciu et al. Sep 2003 A1
20030177132 Thomas et al. Sep 2003 A1
20030191699 Deveault et al. Oct 2003 A1
20030195898 Agarwal et al. Oct 2003 A1
20030231769 Bolle et al. Dec 2003 A1
20030236822 Graupner et al. Dec 2003 A1
20040006532 Lawrence et al. Jan 2004 A1
20040024675 Lahre et al. Feb 2004 A1
20040054144 Itai Mar 2004 A1
20040064341 Langan et al. Apr 2004 A1
20040095617 Mangerson May 2004 A1
20040122787 Avinash et al. May 2004 A1
20040122719 Sabol et al. Jun 2004 A1
20040147817 Dewing et al. Jul 2004 A1
20040161133 Elazar et al. Aug 2004 A1
20040174597 Craig et al. Sep 2004 A1
20040181376 Fables et al. Sep 2004 A1
20040193572 Leary Sep 2004 A1
20040215626 Colossi et al. Oct 2004 A1
20040215981 Ricciardi et al. Oct 2004 A1
20040225202 Skinner Nov 2004 A1
20040240542 Yeredor et al. Dec 2004 A1
20040249650 Freedman et al. Dec 2004 A1
20040249678 Henderson Dec 2004 A1
20050004823 Hnatio Jan 2005 A1
20050018861 Tashev Jan 2005 A1
20050038608 Chandra et al. Feb 2005 A1
20050043060 Brandenberg et al. Feb 2005 A1
20050049988 Dahlquist et al. Mar 2005 A1
20050050068 Vaschillo et al. Mar 2005 A1
20050102210 Song et al. May 2005 A1
20050125325 Chat et al. Jun 2005 A1
20050144062 Mittal et al. Jun 2005 A1
20050149466 Hale et al. Jul 2005 A1
20050165594 Chandra et al. Jul 2005 A1
20050169367 Venetianer et al. Aug 2005 A1
20050187437 Matsugu et al. Aug 2005 A1
20050216273 Reding et al. Sep 2005 A1
20050246189 Monitzer et al. Nov 2005 A1
20060000420 Davies Jan 2006 A1
20060004582 Claudatos et al. Jan 2006 A1
20060004609 Kenneth et al. Jan 2006 A1
20060069514 Chow et al. Mar 2006 A1
20060111961 McQuivey May 2006 A1
20060149705 Friedlander et al. Jul 2006 A1
20060161392 Sholl et al. Jul 2006 A1
20060184483 Clark et al. Aug 2006 A1
20060206379 Rosenberg Sep 2006 A1
20060218010 Mignon et al. Sep 2006 A1
20060251339 Gokturk et al. Nov 2006 A1
20060259329 Kline Nov 2006 A1
20060282222 Mitsuyama et al. Dec 2006 A1
20060287890 Stead et al. Dec 2006 A1
20070011134 Langseth et al. Jan 2007 A1
20070013776 Venetianer et al. Jan 2007 A1
20070027636 Rabinowitz Feb 2007 A1
20070027674 Parson et al. Feb 2007 A1
20070054282 Liew Mar 2007 A1
20070061287 Le et al. Mar 2007 A1
20070073654 Chow et al. Mar 2007 A1
20070106478 Jung et al. May 2007 A1
20070122003 Dobkin et al. May 2007 A1
20070174090 Friedlander et al. Jul 2007 A1
20070174091 Friedlander et al. Jul 2007 A1
20070185586 Al-Attar et al. Aug 2007 A1
20070185737 Friedlander et al. Aug 2007 A1
20070203872 Flinn et al. Aug 2007 A1
20070225577 Mathan Sep 2007 A1
20070230270 Calhoun Oct 2007 A1
20070233631 Kobayashi et al. Oct 2007 A1
20070244701 Erlanger et al. Oct 2007 A1
20070274337 Purpura Nov 2007 A1
20070276851 Friedlander et al. Nov 2007 A1
20070299691 Friedlander et al. Dec 2007 A1
20080004793 Horvitz et al. Jan 2008 A1
20080004951 Huang et al. Jan 2008 A1
20080015871 Eder Jan 2008 A1
20080024299 Robertson Jan 2008 A1
20080031491 Ma et al. Feb 2008 A1
20080033253 Neville Feb 2008 A1
20080055049 Weill et al. Mar 2008 A1
20080067244 Marks Mar 2008 A1
20080071162 Jaeb et al. Mar 2008 A1
20080077463 Friedlander et al. Mar 2008 A1
20080082356 Friedlander et al. Apr 2008 A1
20080082374 Kennis et al. Apr 2008 A1
20080082399 Noble et al. Apr 2008 A1
20080092245 Alward et al. Apr 2008 A1
20080098456 Alward et al. Apr 2008 A1
20080109398 Harter May 2008 A1
20080114724 Indeck et al. May 2008 A1
20080208801 Friedlander et al. Aug 2008 A1
20080208813 Friedlander et al. Aug 2008 A1
20080208814 Friedlander et al. Aug 2008 A1
20080208832 Friedlander et al. Aug 2008 A1
20080208838 Friedlander et al. Aug 2008 A1
20080208901 Friedlander et al. Aug 2008 A1
20080208902 Friedlander et al. Aug 2008 A1
20080208903 Friedlander et al. Aug 2008 A1
20080208904 Friedlander et al. Aug 2008 A1
20080228577 Decre et al. Sep 2008 A1
20080228747 Thrall et al. Sep 2008 A1
20080240496 Senior Oct 2008 A1
20080243439 Runkle et al. Oct 2008 A1
20080254481 Love Oct 2008 A1
20080260212 Moskal et al. Oct 2008 A1
20080262743 Lewis et al. Oct 2008 A1
20080270398 Landau et al. Oct 2008 A1
20080294459 Angell et al. Nov 2008 A1
20080294692 Angell et al. Nov 2008 A1
20080306895 Karty Dec 2008 A1
20080317292 Baker et al. Dec 2008 A1
20090002155 Ma et al. Jan 2009 A1
20090024553 Angell et al. Jan 2009 A1
20090043593 Herbrich et al. Feb 2009 A1
20090070138 Langheier et al. Mar 2009 A1
20090092283 Whillock et al. Apr 2009 A1
20090106179 Friedlander et al. Apr 2009 A1
20090109795 Marti Apr 2009 A1
20090164302 Jung et al. Jun 2009 A1
20090171783 Raju Jul 2009 A1
20090185723 Kurtz et al. Jul 2009 A1
20090195401 Maroney et al. Aug 2009 A1
20090231436 Faltesek et al. Sep 2009 A1
20090240523 Friedlander et al. Sep 2009 A1
20090273468 Mazar et al. Nov 2009 A1
20090287503 Angell et al. Nov 2009 A1
20090299766 Friedlander et al. Dec 2009 A1
20100008515 Fulton et al. Jan 2010 A1
20100035244 Brody Feb 2010 A1
20100131206 Angell et al. May 2010 A1
20100131263 Angell et al. May 2010 A1
20100131502 Fordham May 2010 A1
20100148970 Angell et al. Jun 2010 A1
20100150457 Angell et al. Jun 2010 A1
20100150458 Angell et al. Jun 2010 A1
20100153133 Angell et al. Jun 2010 A1
20100153146 Angell et al. Jun 2010 A1
20100153147 Angell et al. Jun 2010 A1
20100153174 Angell et al. Jun 2010 A1
20100153180 Angell et al. Jun 2010 A1
20100153353 Angell et al. Jun 2010 A1
20100153389 Angell et al. Jun 2010 A1
20100153390 Angell et al. Jun 2010 A1
20100153458 Angell et al. Jun 2010 A1
20100153470 Angell et al. Jun 2010 A1
20100153597 Angell et al. Jun 2010 A1
20100177169 Saric Jul 2010 A1
20100177950 Donovan Jul 2010 A1
20100207874 Yuxin et al. Aug 2010 A1
Foreign Referenced Citations (10)
Number Date Country
0772367 May 1997 EP
0959635 Nov 1999 EP
8316872 Nov 1996 JP
2002312373 Oct 2002 JP
2002342484 Nov 2002 JP
20080082924 Sep 2008 KR
9419571 Sep 1994 WO
9726718 Jul 1997 WO
0100807 Jan 2001 WO
0108077 Feb 2001 WO
Non-Patent Literature Citations (56)
Entry
U.S. Appl. No. 12/907,346: Final Office Action dated January 22, 2013.
U.S. Appl. No. 12/907,346: Non-Final Office Action dated June 4, 2012.
Yalch et al., “The Effects of Music in a Retail Setting on Real and Perceived Shopping Times,” Journal of Business Research 49, pp. 139-147, 2000.
Ahmad et al., “An Artificial Neural Network Model for Generating Hydrograph Fron Hydrometeorological Parameters,” Dept of Civil, Architectural and Environmental Engineering, University of Miami, Mar. 31, 2005 (Abstract Only).
Dept of Health and Human Services Agency for Healthcare Research and Quality, “AHRQ Quality Indicators—Patient Safety Indicators—Technical Specifications,” 2012, pp. 1-149. http://www.qualityindicators.ahrq.gov.
J. Altmann et al., “Cooperative Software Development: Concepts, Model and Tools,” Technology of Object-Oriented Languages and Systems, 1999, pp. 1-14.
R. Beaglehole, “Men Aging and Health: Achieving Health Across the Life Span,” Second World Congress on the Ageing Male, World Health Organization, Feb. 2000, pp. 1-63.
M. Bitner, “The Impact of Physical Surroundings on Customer and Employees,” Journal of Marketing, vol. 56, pp. 57-71, Apr. 1992.
M. Borg et al., “Video Surveillance for Aircraft Activity Monitoring”, IEEE Conference on Advanced Video and Signal Based Surveillance, 2005, pp. 1-6.
Brown et al., “IBM Smart Surveillance System (S3): An Open and Extensible Architecture for Smart Video Surveillance,” pp. 1-4, IBM TJ Watson Research Center.
Wong et al., “Rule-Based Anomaly Pattern Detection for Detecting Disease Outbreaks,” AAAI-02 Proceedings, 2002, pp. 1-7.
Ming Chen et al., “Research on Organization Method of Development Activities for Complicated Product,” Computer Supported Cooperative Work in Design, 2005. Proceedings of the Ninth International Conference on, vol. 1, pp. 234-239 (Abstract).
Shou-Qi Cao et al., “Research on Resource Scheduling for Development Process of Complicated Product,” Computer Supported Cooperative Work in Design, 2005. Proceedings of the Ninth International Conference on, vol. 1, pp. 229-233 (Abstract).
J. Davis et al., “An Adaptive Focus-of-Attention Model for Video Surveillance and Monitoring”, Machine Vision and Applications No. 18, 2007, pp. 41-64.
Knowledge@Wharton, Tag Team, “Tracking the Pattern of Supermarket Shoppers,” Published Jun. 1, 2005.
Girgensohn et al., “Determining Activity Patterns in Retail Spaces Through Video Analysis,” MM'08, Oct. 26-31, 2008.
Kun Wang et al., “A Mathematical Approach to Disaster Recovery Planning,” Proceedings of the First International Conference on Semantics, Knowledge, and Grid, 2005, pp. 1-3 (Abstract).
Goodwin, et al., “Data Mining for Preterm Birth Prediction,” 2000, pp. 46-51, ACM.
AAFP, “Graham Center One-Pager, Types of Medical Errors Commonly Reported by Family Physicians”, Am Fam Physician, Feb. 2003.
Grimson et al., “The SI Challenge in Health Care,” Communications of the ACM, Jun. 2000, pp. 49-55, ACM.
Grzymala-Busse, “Knowledge Acquisition Under Uncertainty—A Rough Set Approach,” Journal of Intelligent and Robotic Systems, 1988 (Abstract).
Gulas et al., “Right Under Our Noses: Ambient Scent and Consumer Responses,” Journal of Business and Psychology, Fall 1995.
Han, et al., “Discovery of Multiple-Level Association Rules From Large Databases,” Proceedings of the 1995 International Conference for Very Large Data Bases, 1995. pp. 420-431.
Hashemi et al, “Development of Group's Signature for Evaluation of Skin Cancer in Mice Caused by Ultraviolet Radiation,” Proceedings of the International Conference of Information Technology: Computers and Communications, ITCC 2003, IEEE Computer Society, Washington, DC, USA, Apr. 28-30, 2003, pp. 1-4 (Abstract Only).
Phillip E. Hayes et al., “Picking Up the Pieces: Utilizing Disaster Recovery Project Management to Improve Readiness and Response Time,” IEEE Industry Applications Magazine, Nov./Dec. 2002, pp. 1-10 (Abstract).
L. Herbert, “Othello Error: Facial Profiling, Privacy, and the Suppression of Dissent”, Ohio State Journal of Criminal Law, vol. 5, 2007, pp. 79-129.
Hoshiai et al., “Sion Architecture: Sematic Information-Oriented Network Architecture”, Transaction of the Institute of Electronics, Information and Communication Engineers, vol. J84-B, No. 3, pp. 411-424, Mar. 2001, Abstract Only.
Hsinchun Chen, “Machine Learning for Information Retrieval: Neural Networks, Symbolic Learning, and Genetic Algorithms,” Journal of the American Society for Information Science, Apr. 1995, pp. 194-216.
Johansson et al., “Visual Analysis Based on Algorithmic Classification,” Proceedings of the Seventh International Conference on Information Visualization, London, England, Jul. 16-18, 2003, pp. 1-4 (Abstract Only).
Kiang, “Extending the Kohonen Self-Organizing Map Networks for Clustering Analysis,” Journal, Computational Statistics & Data Analysis, vol. 38, December 2, 2001, pp. 161-180.
C. Larson et al., “The Shape of Threat: Simple Geometric Forms Evoke Rapid and Sustained Capture of Attention”, Emotion 2007, Vol. 7, No. 3, pp. 526-534.
E. Lin and L. Haas., “IBM Federated Database Technology,” Mar. 1, 2002, IBM Developerworks Library, pp. 1-9.
Lowery et al., “Barriers to Implementing Simulation in Health Care,” Proceedings From the 1994 Winter Simulation Conference, pp. 868-875 (Abstract Only).
Luckham et al., “Event Processing Glossary,” Jul. 2008, pp. 1-19. http://complexevents.com.
Lurie, “The Federation Database Interoperability,” Apr. 24, 2003, IBM Developerworks Library, pp. 1-12.
Lymberopoulos et al., “An Easy-to-Program Sensor System for Parsing Out Human Activities,” Embedded Networks and Application Lab, Enalab, Yale University, New Haven, CT, 2008, pp. 1-17.
Y. Matsushita et al., “Illumination Normalization With Time-Dependent Intrinsic Images for Video Surveillance”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, Issue 10, Oct. 2004, pp. 1336-1347.
McShan et al, “Pathminer: Predicting Metabolic Pathways by Heuristic Search,” School of Medicine, University of Colorado, 2003 (Abstract Only).
A. Oredsson, “Cognitive Video Surveillance: An ANN/CBR Hybrid Approach”, Master of Science in Informatics, Norwegian University of Science and Technology, Submitted Jun. 2007, pp. 1-136.
Polak et al., “Using Automated Analysis of the Resting Twelve-Lead ECG to Identify Patients at Risk of Developing Transient Myocardial Ischaemia—An Application of an Adaptive Logic Network,” Physiological Measurement, vol. 18, No. 4, Nov. 1997, pp. 317-325.
Schadow et al., “Discussion Paper: Privacy-Preserving Distributed Queries for a Clinical Case Research Network,” IEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, 2002 (Abstract).
William E. Souder, “Analytical Effectiveness of Mathematical Models for R&D Project Selection,” Management Science, vol. 19, No. 8, Application Seires, Apr. 1973, pp. 907-923 (Abstract).
N. Siebel et al., “The Advisor Visual Surveillance System”, Applications of Computer Vision '04, Prague, May 16, 2004, pp. 103-111.
E. A. Silver, “An Overview of Heuristic Solution Methods,” The Journal of the Operational Research Society, vol. 55, No. 9, Sep. 2004, pp. 936-956 (Abstract).
Shelfer, et al., “Smart Card Evolution,” Communications of the ACM, Jul. 2002, pp. 83-88, vol. 45, No. 7, ACM (Abstract Only).
Adams, et al., “Positive Patient Identification: A Practical Solution to a Challenging Problem,” Toward an Electronic Patient '97, Conference and Exposition, Proceedings, PT. vol. 3, 1997, Abstract Only.
Chatfield, “Marketing an HMO by ‘Smart’ ID Cards With Patient History on an Electronic Medical Record”, Proceedings, Toward an Electronic Patient Record '96, Twelfth International Symposium on the Creation of Electronic Health Record System and Global Conference on Patient Cards, PT. vol. 1, 1996, Abstract Only.
Gabrieli, “Guide for Unique Healthcare Identifier Model”, Journal of Clinical Computing, vol. 21, No. 5, 1993, Abstract Only.
Goehring, “Identification of Patients in Medical Databases—Soundex Codes Versus Match Code”, Medical Informatics, vol. 10, No. 1, pp. 27-34, Jan.-Mar. 1985, Abstract Only.
Wang, “A Cobra-Based Object Framework With Patient Identification Translation and Dynamic Linking. Methods for Exchanging Patient Data”, Methods of Information in Medicine, vol. 38, No. 1, Mar. 1999, Abstract Only.
U.S. Appl. No. 12/829,886, Specification filed Jul. 2, 2010, Friedlander et al.
U.S. Appl. No. 12/907,346: Examiner's Answer dated Aug. 28, 2013.
B. Welsh et al., “Effects of Improved Street Lighting on Crime,” September 24, 2008, Campbell Systematic Reviews, The Campbell Collaboration, pp. 1-54.
B. Hall et al., “Identifying Age, Cohort and Period Effects in Scientific Research Productivity: Discussion and Illustration Using Simulated and Actual Data on French Physicists”, Jun. 26, 2005, Economics of Innovation and New Technology, Taylor and Francis Journals, vol. 16 (2), pp. 1-29.
U.S. Appl. No. 12/907,346 Decision on Appeal Mailed April 1, 2016.
U.S. Appl. No. 12/907,346 Examiner's Answer dated Nov. 29, 2017.
Related Publications (1)
Number Date Country
20120095948 A1 Apr 2012 US
Continuation in Parts (1)
Number Date Country
Parent 12907346 Oct 2010 US
Child 13275483 US