The disclosure relates generally to a healthcare system.
The healthcare industry currently has a number of issues that need to be resolved including
The need for seamless interoperability within the Health industry is of utmost concern. This includes all aspects of the consumer, payer and provider landscape. Healthcare enterprise applications (e.g. Electronic Medical Record systems (EMRs), Electronic HealthCare Records (EHRs), Practice Management systems (PMs) and payor solutions) have been created within many areas of healthcare information technology to supposedly address specific end user (consumer) requirements. However these applications do not allow for interoperability and transparency of data operations.
For example, the EMR(s) exist as islands of information with little or no connectivity between the plethora of product offerings. This has been further exacerbated with the usage of Electronic Data Interchange “standards” such as ASC 4010/5010 X12 (further details of which are found at http://www.x12.org/which is incorporated herein by reference.) Further, the process deepens within the same hospital system and what connectivity has been implemented has been a largely manual effort with significant costs in implementation and maintenance, further exacerbating the situation. This scenario gives way to an Application Programming Interface (API) system that is REST based and that is multi-tenancy. Multi-tenancy is an architecture in which a single instance of a software application serves multiple customers. Each customer is called a tenant. With multi-tenancy, scaling has far fewer infrastructure implications for vendors (depending on the size of the application and the amount of infrastructure required). Further, a multitenant software system is a system that supports any number of customers within a single application instance. Typically, that single instance makes use of a shared data set(s), where a customer's data is properly separated from another's. While data separation is a crucial aspect of a multitenant application, there may be system-wide (e.g. global) computations that require the consumption of all customer data (or some subset thereof). If no such global operations are required, then a multitenant application would instead be a multi-instance application, where each customer's data is contained in its own isolated silo.
According to the Healthcare Information and Management Systems Society (HIMSS-details of which are at http://www.himss.org/which is incorporated herein by reference), analytics organization, larger countries (such as the United States, Canada, Germany, France, Italy and Spain) are behind several smaller European countries (such as Denmark, Holland and Sweden) in reaching the highest level of paperless data sharing, storage and decision support according to Uwe Buddrus, HIMSS Analytics Europe, personal communication. The number of faxes per year in healthcare in the United States alone approach 15(million) annually. There is a hard line requirement to reduce the paper interactions and move to more fluid electronic formats.
The system and method described below aggregates all of the healthcare data into a global graph-theoretic topology and processes the data via a hybrid federated and peer to peer distributed processing architecture (which are further details of which are described at https://en.wikipedia.org/wiki/Peer-to-peer and https://en.wikipedia.org/wiki/Peer-to-peer which are incorporated herein by reference.) Some of the data contained in these processes may include but are not limited to:
The system and method may implement the models of Electronic Data Interchange (EDI) under ASC X12 in several differing manners and programmatic methodologies. The following are some of the hurdles:
JavaScript Object Notation (JSON) has resulted in a better readable standard however the data model and schemas from the standards above are constantly shifting.
Thus, current healthcare enterprise applications need greater flexibility and scalability to meet the challenges of heterogeneity of healthcare systems at all levels—data, process, services, and payments. The architecture of any integration system holds the key to offer a dynamic, flexible and scalable solution.
The system and method uses an Agent/Actor model for data processing and observations (further details of which are described at http://c2.com/cgi/wiki?ActorVsAgent which is incorporated herein by reference.) The agent/actor model includes vendors, standards, legacy systems, and information systems all of which must interoperate to provide healthcare services. The system and method provide an interoperability solution without imposing any constraint on existing or proposed health systems. The major advantage of our approach is that it is a hybrid federated and decentralized system that is resilient and autonomous and requires no pre-approved or administrative overhead for participating in the HealthCare network. Further it affords payors, providers and consumers the ability to have access to the consumers data, given the consumer's granted consent, as well as provide the consumer the ability to maintain real time access and control of their personal health record (PHR).
Ideally, EHR/EMRs capture and integrate data on all aspects of care over time, with the data being represented according to relevant data structures and provide in real time the consumer access to the PHR. Currently this is not the case. The system and method and its processing architecture and model of data access will allow accurate data to flow within the system and provide transparent behaviors and access across the system.
Much of the data that is captured in EHR/EMR systems serve administrative purposes, such as monitoring hospital activity and performance, and government or insurance reimbursement. Even simple EHR/EMR systems will typically capture demographic patient information such as age, gender, ethnicity and address, as well as structured information about a given encounter in the form of dates and CPT (Current Procedural Terminology) and ICD (International Classification of Diseases) encoded services and diagnoses (often referred to as billing codes for both inpatient and outpatient). Most often these coding schemas are not automated and are prone to user error as well as double charge processes. This double charge process is often the culprit when processing claims information. Further the double charge in a ledger is also an artifact and error of processes within historical electronic banking systems whereas the ledger does not de-duplicate the ledger of record.
The system and method provide and use identity management that allows immediate access to the consumers PHR that could integrated with various different health applications, such as for example, Fit-Bit, Jawbone, Apple Apple Health Kit or PayPal. The system and method also provide peer to peer autonomous accurate health information exchange and transactional processing that will allow real time processing as well as immediate access and interoperability.
Exemplary Implementation Overview
As shown in
The backend 104 and the health block chain network components may be implemented using one or more computing resources such as server computers, blade servers, mainframe computers, processors, memory, storage devices and the like. The backend 104 and the health block chain network components may be coupled to one or more health data sources 108 over the communications path 106. The backend 104 and the health block chain network components may communicate with the health data sources using the standards, protocols and/or APIs for each data source. In the example in
As described above, one or more applications 102, such as host applications, that can access the Health BlockChain Network components 104A-104N. The Networks can be manifold in nature from a processing standpoint however focus on three main areas of processing for the (1) for the payer where there is a need to processing pricing data, eligibility, claims and benefits processing data (2) for the provider where there is a need for electronic medical/health records, scheduling and clinical, diagnosis and payment data (3) for the consumer where there is a need for the personal health record, scheduling information and payment data. This is illustrated via the host applications 102 that could cover the above scenarios and the blockchain processing which is a hybrid federated and decentralized and a file system which is distributed in nature.
As shown in
The application(s) 102 which utilize the Health BlockChain network(s) will facilitate the access, storage and distribution of health data, PHR/EHR/EMR, as well as health transactions, X12/Clinical and may be known as a health block chain application. An example of an application stack for each application 102 is shown in
The Health Blockchain itself is organized as a distributed database of data blocks, or replicated shared ledger, in a constantly growing linked list, where each block is cryptographically verified by multiple nodes on the network. The structure and relationships of the block database is shown in
The data structure for the block structure is depicted in Table 1.0 and Table 1.1 below:
To verify that inputs are authorized to collect the values of referenced outputs, a built-in scripting language is used. This scripting language is Turing-complete, stack-based and processed from left to right. The script language is typically written in a high level language (for example, solidity https://ethereum.github.io/solidity/docs/home/) and then compiled into the raw opcodes included in the blockchain transaction (pseudo-code representing this high-level language is used throughout this document in example transactions). The transaction inputs are authorized if the executed script returns true. Through the scripting system, the sender can create very complex conditions that actors in the system must meet in order to claim the output. In this way any automated system of checks, authorizations, actions or even external events can be involved and validated as part of the transaction.
The transaction data may consist of a Colored Coin implementation (described in more detail at https://en.bitcoin.it/wiki/Colored_Coins which is incorporated herein by reference), based on Open Assets (described in more detail at https://github.com/OpenAssets/open-assets-protocol/blob/master/specification.mediawiki which is incorporated herein by reference), using on the OP_RETURN operator. Metadata is linked from the Blockchain and stored on the web, dereferenced by resource identifiers and distributed on public torrent files. The colored coin specification provides a method for decentralized management of digital assets and smart contracts (described in more detail at https://github.com/ethereum/wiki/wiki/White-Paper which is incorporated herein by reference.) For our purposes the smart contract is defined as an event-driven computer program, with state, that runs on a blockchain and can manipulate assets on the blockchain. So a smart contract is implemented in the blockchain scripting language in order to enforce (validate inputs) the terms (script code) of the contract.
The digital assets are managed, transferred or involved in a smart contract. Payers issue assets such as a benefits data, or eligibility information. Providers issue assets for clinical documents, health records which the consumer may receive and grant access to through the use of smart contracts.
Usage Scenarios
The above block chain processing and system shown in
The system specifically deals with utilizing “side chaining” to process the private or semi-private smart contracts between the seller and buyers. A sidechain is a blockchain that validates data from other blockchains. These are implemented via “pegging.” A pegged sidechain is a sidechain whose assets can be imported from and returned to other chains; that is, a sidechain that supports two-way pegged assets. Two-way peg refers to the mechanism by which (in our case) assets are transferred between sidechains and back at a fixed or otherwise deterministic exchange rate which is based on contextual rate of transfer or value in the case of our trade or arbitrage asset environment.
The specific nature of implementation of the system and method are based upon a networked graph based structure that is input into the “Health BlockChain” distributed process. This networked environment also allows for the basis of exchange models based on exchange theory. The algorithms sub-divides our graph of the distributed network into sub-graphs: those in which a set of sellers are collectively linked to a larger set of buyers (sellers obtain payoffs in a game-theoretic sense close to 1) and buyers receive payoffs near 0; those in which the collective set of sellers is linked to a same size collective set of buyers (each receive a payoff of about ½); and those in which sellers outnumber buyers (sellers receive payoffs near 0 and buyers obtain payoffs close to 1).
With respect to the architecture and data processes, the system updates using an exchange process based on former work by Corominas-Bosch and which processes exchange mechanics link patterns represent the potential transactions, however, the transactions and prices are determined by an auction rather than bargaining. In the case of the general model there are n sellers and m buyers of a homogenous good for which all sellers have reservation value 0 and all buyers have reservation value 1. Each buyer desires only one unit of the good, and each seller can supply only one unit. Is the price dependent only on the relative sizes of n and m, and will all trades take place at the same price? Here buyers (sellers) bargain with a pre-assigned subset of all sellers (buyers); links are non-directed, which means that A is linked to B if and only if B is linked to A. Any buyer may be connected to multiple sellers and vice versa. The network structure is common information, as are all proposals and acceptances. In our case of the reduction to practice our homogenous good is the respective connections, business agreements or service level agreements with respect to accessing said data within the blockchain.
In particular, prices rise simultaneously across all sellers. Buyers drop out when the price exceeds their valuation (as they would in an English or ascending oral auction). As buyers drop out, there emerge sets of sellers for whom the remaining buyers still linked to those sellers is no larger than the set of sellers. Those sellers transact with the buyers still linked to them. The exact matching of whom trades with whom given the link pattern is done carefully to maximize the number of transactions. Those sellers and buyers are cleared from the market, and the prices continue to rise among remaining sellers, and the process repeats itself. When the market price is cleared the agent updates the graph or subgraph and the ledger or ledgers in the blockchain are updated. The main agent based graph process splits the links into sub-graphs allowing faster processing and the payoffs in the network are based on game-theoretic probabilities as follows:
With respect to our network, it has a very simple process for finding the equilibrium in the market such that the ledger clears and makes the market price in our case:
Health Care EDI Transactions (ASC X12 4010/5010)
Processing health care transactions currently consists of manual agreements covering point-point solutions. These connections take significant effort from technical and administrative personnel to setup and maintain. In this scenario the proposed public blockchain solution can facilitate an automatic smart contract to cover a transaction as well as automatic service-level-agreement based selection of a trading partner to fulfill a request.
An example of a typical workflow for a referral is shown in
The pseudo code for the smart contract to implement the typical ASC X12 referral transaction is as follows.
Eligibility Transaction
PHR Transaction
Referral transaction, receives inputs of outputs from Eligibility and PHR transactions
Patient Behavior and Risk Pool Rated Health Plans
With the advent of personal health trackers, new health plans are rewarding consumers for taking an active part in their wellness. Similar to car insurance plans that offer discounts for installing a driving monitor, e.g. Progressive Snapshot® (https://www.progressive.com/auto/snapshot/), these plans are typically facilitated by the manufacturers of fitness tracking devices and partnerships have been formed, e.g. Fitbit Wellness Partners (http://www.fitbit.com/fitbit-wellness/partners.) The Health BlockChain network will facilitate a more open distribution of the consumers wellness data and protect it as PHR must be, and therefore prevent lock-in of consumers, providers and payers to a particular device technology or health plan. In particular, since PHR data is managed on the blockchain a consumer and/or company can grant access to a payer to this data such that the payer can perform group analysis of an individual or an entire company's employee base including individual wellness data and generate a risk score of the individual and/or organization. Having this information, payers can then bid on insurance plans tailored for the specific organization. Enrollment then, also being managed on the blockchain, can become a real-time arbitrage process as shown in
The pseudo code for the smart contract to implement a patient behavior based health plan is as follows.
Patient and Provider Data Sharing
A patient's Health BlockChain wallet stores all assets, which in turn store reference ids to the actual data, whether clinical documents in HL7 or FHIR format, wellness metrics of activity and sleep patterns, or claims and enrollment information. These assets and control of grants of access to them is afforded to the patient alone. Given the open distribution of the Health BlockChain, any participating provider can be given full or partial access to the data instantaneously and automatically via enforceable restrictions on smart contracts.
In today's typical doctor visit scenario where a new patient arrives for the first time the attending physician has no prior history except for what is documented in the paperwork completed by the patient while waiting to be seen. This is time consuming and takes away from the purpose of the visit.
Utilizing the Health BlockChain the access to a patient's PHR can be granted as part of scheduling an appointment, during a referral transaction or upon arrival for the visit. And, access can just as easily be removed, all under control of the patient.
A scenario where upon arrival at the doctor's office a bluetooth proximity sensor can identify a patient running a mobile application on their personal bluetooth capable device which is a proxy for the patient's Health BlockChain wallet is shown in
The pseudo code for the smart contract to implement a patient and provider data sharing is as follows.
Patient Data Sharing
Patient's PHR data is valuable information for their personal health profile in order to provide Providers (Physicians) the necessary information for optimal health care delivery. In addition this clinical data is also valuable in an aggregate scenario of clinical studies where this information is analyzed for diagnosis, treatment and outcome. Currently this information is difficult to obtain due to the siloed storage of the information and the difficulty on obtaining patient permissions.
Given a patient Health BlockChain wallet that stores all assets as reference ids to the actual data. These assets can be included in an automated smart contract for clinical study participation or any other data sharing agreement allowed by the patient. The assets can be shared as an instance share by adding to the document a randomized identifier or nonce, similar to a one-time use watermark or serial number, a unique asset (derived from the original source) is then generated for a particular access request and included in a smart contract as an input for a particular request for the patient's health record information. A patient can specify their acceptable terms to the smart contract regarding payment for access to PHR, timeframes for acceptable access, type of PHR data to share, length of history willing to be shared, de-identification thresholds or preferences, specific attributes of the consumer of the data regarding trusted attributes such as reputation, affiliation, purpose, or any other constraints required by the patient. Attributes of the patient's data are also advertised and summarized as properties of the smart contract regarding the type of diagnosis and treatments available. Once the patient has advertised their willingness to share data under certain conditions specified by the smart contract it can automatically be satisfied by any consumer satisfying the terms of the patient and their relevance to the type of PHR needed resulting in a automated, efficient and distributed means for clinical studies to consume relevant PHR for analysis. This process shown in
The pseudo code for the smart contract to implement automated patient data sharing is as follows.
Health BlockChain Data Elements
The actual data, assets, contracts, PII, etc. stored on the blockchain are actually resource identifiers which uniquely identify the data, location and access thereof as shown in
Patients
Basic Demographics
Insurance Information
Health Records
Marketplace Interactions
Self Reported Health Statistics Via Wearable APIs
Financial Information
Social Network Interaction Data
Wearable API Data
Providers
Provider Demographics
Medical Education
Pricing
Ratings, Reviews, Recognitions
Claims Statistics
Payers (Aka Insurance Carriers, Trading Partners)
With the processing of X12 health transactions, the system can easily obtain the following information:
The foregoing description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the disclosure and its practical applications, to thereby enable others skilled in the art to best utilize the disclosure and various embodiments with various modifications as are suited to the particular use contemplated.
The system and method disclosed herein may be implemented via one or more components, systems, servers, appliances, other subcomponents, or distributed between such elements. When implemented as a system, such systems may include an/or involve, inter alia, components such as software modules, general-purpose CPU, RAM, etc. found in general-purpose computers. In implementations where the innovations reside on a server, such a server may include or involve components such as CPU, RAM, etc., such as those found in general-purpose computers.
Additionally, the system and method herein may be achieved via implementations with disparate or entirely different software, hardware and/or firmware components, beyond that set forth above. With regard to such other components (e.g., software, processing components, etc.) and/or computer-readable media associated with or embodying the present inventions, for example, aspects of the innovations herein may be implemented consistent with numerous general purpose or special purpose computing systems or configurations. Various exemplary computing systems, environments, and/or configurations that may be suitable for use with the innovations herein may include, but are not limited to: software or other components within or embodied on personal computers, servers or server computing devices such as routing/connectivity components, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, consumer electronic devices, network PCs, other existing computer platforms, distributed computing environments that include one or more of the above systems or devices, etc.
In some instances, aspects of the system and method may be achieved via or performed by logic and/or logic instructions including program modules, executed in association with such components or circuitry, for example. In general, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular instructions herein. The inventions may also be practiced in the context of distributed software, computer, or circuit settings where circuitry is connected via communication buses, circuitry or links. In distributed settings, control/instructions may occur from both local and remote computer storage media including memory storage devices.
The software, circuitry and components herein may also include and/or utilize one or more type of computer readable media. Computer readable media can be any available media that is resident on, associable with, or can be accessed by such circuits and/or computing components. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and can accessed by computing component. Communication media may comprise computer readable instructions, data structures, program modules and/or other components. Further, communication media may include wired media such as a wired network or direct-wired connection, however no media of any such type herein includes transitory media. Combinations of the any of the above are also included within the scope of computer readable media.
In the present description, the terms component, module, device, etc. may refer to any type of logical or functional software elements, circuits, blocks and/or processes that may be implemented in a variety of ways. For example, the functions of various circuits and/or blocks can be combined with one another into any other number of modules. Each module may even be implemented as a software program stored on a tangible memory (e.g., random access memory, read only memory, CD-ROM memory, hard disk drive, etc.) to be read by a central processing unit to implement the functions of the innovations herein. Or, the modules can comprise programming instructions transmitted to a general purpose computer or to processing/graphics hardware via a transmission carrier wave. Also, the modules can be implemented as hardware logic circuitry implementing the functions encompassed by the innovations herein. Finally, the modules can be implemented using special purpose instructions (SIMD instructions), field programmable logic arrays or any mix thereof which provides the desired level performance and cost.
As disclosed herein, features consistent with the disclosure may be implemented via computer-hardware, software and/or firmware. For example, the systems and methods disclosed herein may be embodied in various forms including, for example, a data processor, such as a computer that also includes a database, digital electronic circuitry, firmware, software, or in combinations of them. Further, while some of the disclosed implementations describe specific hardware components, systems and methods consistent with the innovations herein may be implemented with any combination of hardware, software and/or firmware. Moreover, the above-noted features and other aspects and principles of the innovations herein may be implemented in various environments. Such environments and related applications may be specially constructed for performing the various routines, processes and/or operations according to the invention or they may include a general-purpose computer or computing platform selectively activated or reconfigured by code to provide the necessary functionality. The processes disclosed herein are not inherently related to any particular computer, network, architecture, environment, or other apparatus, and may be implemented by a suitable combination of hardware, software, and/or firmware. For example, various general-purpose machines may be used with programs written in accordance with teachings of the invention, or it may be more convenient to construct a specialized apparatus or system to perform the required methods and techniques.
Aspects of the method and system described herein, such as the logic, may also be implemented as functionality programmed into any of a variety of circuitry, including programmable logic devices (“PLDs”), such as field programmable gate arrays (“FPGAs”), programmable array logic (“PAL”) devices, electrically programmable logic and memory devices and standard cell-based devices, as well as application specific integrated circuits. Some other possibilities for implementing aspects include: memory devices, microcontrollers with memory (such as EEPROM), embedded microprocessors, firmware, software, etc. Furthermore, aspects may be embodied in microprocessors having software-based circuit emulation, discrete logic (sequential and combinatorial), custom devices, fuzzy (neural) logic, quantum devices, and hybrids of any of the above device types. The underlying device technologies may be provided in a variety of component types, e.g., metal-oxide semiconductor field-effect transistor (“MOSFET”) technologies like complementary metal-oxide semiconductor (“CMOS”), bipolar technologies like emitter-coupled logic (“ECL”), polymer technologies (e.g., silicon-conjugated polymer and metal-conjugated polymer-metal structures), mixed analog and digital, and so on.
It should also be noted that the various logic and/or functions disclosed herein may be enabled using any number of combinations of hardware, firmware, and/or as data and/or instructions embodied in various machine-readable or computer-readable media, in terms of their behavioral, register transfer, logic component, and/or other characteristics. Computer-readable media in which such formatted data and/or instructions may be embodied include, but are not limited to, non-volatile storage media in various forms (e.g., optical, magnetic or semiconductor storage media) though again does not include transitory media. Unless the context clearly requires otherwise, throughout the description, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in a sense of “including, but not limited to.” Words using the singular or plural number also include the plural or singular number respectively. Additionally, the words “herein,” “hereunder,” “above,” “below,” and words of similar import refer to this application as a whole and not to any particular portions of this application. When the word “or” is used in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list and any combination of the items in the list.
Although certain presently preferred implementations of the invention have been specifically described herein, it will be apparent to those skilled in the art to which the invention pertains that variations and modifications of the various implementations shown and described herein may be made without departing from the spirit and scope of the invention. Accordingly, it is intended that the invention be limited only to the extent required by the applicable rules of law.
While the foregoing has been with reference to a particular embodiment of the disclosure, it will be appreciated by those skilled in the art that changes in this embodiment may be made without departing from the principles and spirit of the disclosure, the scope of which is defined by the appended claims.
This application claims the benefit under 35 USC 119(e) and priority under 35 USC 120 to U.S. Provisional Patent Application No. 62/200,272, file Aug. 3, 2015 and titled “System and Method for Decentralized Autonomous Healthcare Economy Platform”, the entirety of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5872021 | Matsumoto et al. | Feb 1999 | A |
6546428 | Baber et al. | Apr 2003 | B2 |
7386565 | Singh et al. | Jun 2008 | B1 |
7917378 | Fitzgerald et al. | Mar 2011 | B2 |
7917515 | Lemoine | Mar 2011 | B1 |
7970802 | Ishizaki | Jun 2011 | B2 |
7992153 | Ban | Aug 2011 | B2 |
8060395 | Frasher et al. | Nov 2011 | B1 |
8073801 | Von Halle et al. | Dec 2011 | B1 |
8095975 | Boss et al. | Jan 2012 | B2 |
8103667 | Azar et al. | Jan 2012 | B2 |
8103952 | Hopp | Jan 2012 | B2 |
8203562 | Alben et al. | Jun 2012 | B1 |
8229808 | Heit | Jul 2012 | B1 |
8286191 | Amini et al. | Oct 2012 | B2 |
8359298 | Schacher et al. | Jan 2013 | B2 |
8364501 | Rana et al. | Jan 2013 | B2 |
8417755 | Zimmer | Apr 2013 | B1 |
8495108 | Nagpal et al. | Jul 2013 | B2 |
8515777 | Rajasenan | Aug 2013 | B1 |
8527522 | Baron | Sep 2013 | B2 |
8817665 | Thubert et al. | Aug 2014 | B2 |
8984464 | Mihal et al. | Mar 2015 | B1 |
9165045 | Mok et al. | Oct 2015 | B2 |
9208284 | Douglass | Dec 2015 | B1 |
20020022973 | Sun et al. | Feb 2002 | A1 |
20020038233 | Shubov et al. | Mar 2002 | A1 |
20020165738 | Dang | Nov 2002 | A1 |
20030055668 | Saran et al. | Mar 2003 | A1 |
20030097359 | Ruediger | May 2003 | A1 |
20030171953 | Narayanan | Sep 2003 | A1 |
20030217159 | Schramm-Apple et al. | Nov 2003 | A1 |
20030233252 | Haskell et al. | Dec 2003 | A1 |
20040143446 | Lawrence | Jul 2004 | A1 |
20050010452 | Lusen | Jan 2005 | A1 |
20050071189 | Blake et al. | Mar 2005 | A1 |
20050102170 | Lefever et al. | May 2005 | A1 |
20050137912 | Rao et al. | Jun 2005 | A1 |
20050152520 | Logue | Jul 2005 | A1 |
20050182780 | Forman et al. | Aug 2005 | A1 |
20050222912 | Chambers | Oct 2005 | A1 |
20060036478 | Aleynikov et al. | Feb 2006 | A1 |
20060074290 | Chen et al. | Apr 2006 | A1 |
20060089862 | Anandarao et al. | Apr 2006 | A1 |
20060129428 | Wennberg | Jun 2006 | A1 |
20060136264 | Eaton et al. | Jun 2006 | A1 |
20060242140 | Wnek | Oct 2006 | A1 |
20070113172 | Behrens et al. | May 2007 | A1 |
20070118399 | Avinash et al. | May 2007 | A1 |
20070156455 | Tarino et al. | Jul 2007 | A1 |
20070174101 | Li et al. | Jul 2007 | A1 |
20070180451 | Ryan et al. | Aug 2007 | A1 |
20070214133 | Liberty et al. | Sep 2007 | A1 |
20070233603 | Schmidgall et al. | Oct 2007 | A1 |
20070260492 | Feied et al. | Nov 2007 | A1 |
20070276858 | Cushman et al. | Nov 2007 | A1 |
20070288262 | Sakaue et al. | Dec 2007 | A1 |
20080013808 | Russo et al. | Jan 2008 | A1 |
20080046292 | Myers | Feb 2008 | A1 |
20080082980 | Nessland et al. | Apr 2008 | A1 |
20080091592 | Blackburn et al. | Apr 2008 | A1 |
20080126264 | Tellefsen | May 2008 | A1 |
20080133436 | Di Profio | Jun 2008 | A1 |
20080215993 | Rossman | Sep 2008 | A1 |
20080288292 | Bi et al. | Nov 2008 | A1 |
20080295094 | Korupolu et al. | Nov 2008 | A1 |
20080319983 | Meadows | Dec 2008 | A1 |
20090083664 | Bay | Mar 2009 | A1 |
20090125796 | Day et al. | May 2009 | A1 |
20090164236 | Holcomb | Jun 2009 | A1 |
20090192864 | Song et al. | Jul 2009 | A1 |
20090198520 | Piovanetti-Perez | Aug 2009 | A1 |
20090300054 | Fisher et al. | Dec 2009 | A1 |
20090307104 | Weng | Dec 2009 | A1 |
20090313045 | Boyce | Dec 2009 | A1 |
20100017222 | Yeluri | Jan 2010 | A1 |
20100070303 | Massounuil | Mar 2010 | A1 |
20100076950 | Kenedy et al. | Mar 2010 | A1 |
20100082620 | Jennings, III et al. | Apr 2010 | A1 |
20100088108 | MacHado | Apr 2010 | A1 |
20100088119 | Tipirneni | Apr 2010 | A1 |
20100138243 | Carroll | Jun 2010 | A1 |
20100217973 | Kress et al. | Aug 2010 | A1 |
20100228564 | Kharraz | Sep 2010 | A1 |
20100228721 | Mok et al. | Sep 2010 | A1 |
20100295674 | Hsieh et al. | Nov 2010 | A1 |
20100332273 | Balasubramanian et al. | Dec 2010 | A1 |
20110009707 | Kaundinya | Jan 2011 | A1 |
20110015947 | Erry et al. | Jan 2011 | A1 |
20110047169 | Leighton | Feb 2011 | A1 |
20110055252 | Kapochunas et al. | Mar 2011 | A1 |
20110071857 | Malov et al. | Mar 2011 | A1 |
20110137672 | Adams et al. | Jun 2011 | A1 |
20110218827 | Kennefick et al. | Sep 2011 | A1 |
20110270625 | Pederson et al. | Nov 2011 | A1 |
20120004943 | Reichman | Jan 2012 | A1 |
20120011029 | Thomas | Jan 2012 | A1 |
20120023107 | Nachnani | Jan 2012 | A1 |
20120035984 | Srinivasa et al. | Feb 2012 | A1 |
20120078940 | Kolluri et al. | Mar 2012 | A1 |
20120130736 | Dunston et al. | May 2012 | A1 |
20120158429 | Murawski et al. | Jun 2012 | A1 |
20120158750 | Faulkner et al. | Jun 2012 | A1 |
20120173279 | Nessa et al. | Jul 2012 | A1 |
20120245958 | Lawrence et al. | Sep 2012 | A1 |
20120246727 | Elovici et al. | Sep 2012 | A1 |
20120290320 | Kurgan et al. | Nov 2012 | A1 |
20120290564 | Mok et al. | Nov 2012 | A1 |
20130030827 | Snyder et al. | Jan 2013 | A1 |
20130044749 | Eisner et al. | Feb 2013 | A1 |
20130085769 | Jost et al. | Apr 2013 | A1 |
20130138554 | Nikankin et al. | May 2013 | A1 |
20130166552 | Rozenwald et al. | Jun 2013 | A1 |
20130204940 | Kinsel et al. | Aug 2013 | A1 |
20130290007 | Hag | Oct 2013 | A1 |
20130304903 | Mick et al. | Nov 2013 | A1 |
20130332194 | D'Auria | Dec 2013 | A1 |
20140046931 | Mok et al. | Feb 2014 | A1 |
20140056243 | Pelletier et al. | Feb 2014 | A1 |
20140059084 | Adams et al. | Feb 2014 | A1 |
20140088981 | Momita | Mar 2014 | A1 |
20140136233 | Atkinson et al. | May 2014 | A1 |
20140180727 | Freibreger | Jun 2014 | A1 |
20140207509 | Yu et al. | Jul 2014 | A1 |
20140222482 | Gautam et al. | Aug 2014 | A1 |
20140244300 | Bess et al. | Aug 2014 | A1 |
20140249878 | Kaufman et al. | Sep 2014 | A1 |
20140278491 | Weiss | Sep 2014 | A1 |
20140358578 | Ptachcinski | Dec 2014 | A1 |
20140358845 | Mundlapudi et al. | Dec 2014 | A1 |
20150006558 | Leighton | Jan 2015 | A1 |
20150095056 | Ryan et al. | Apr 2015 | A1 |
20150112696 | Kharraz Tavakol | Apr 2015 | A1 |
20150142464 | Rusin et al. | May 2015 | A1 |
20150142495 | Garakani | May 2015 | A1 |
20150154528 | Kharraz | Jun 2015 | A1 |
20150199482 | Corbin et al. | Jul 2015 | A1 |
20150332283 | Witchey | Nov 2015 | A1 |
20160028552 | Spanos et al. | Jan 2016 | A1 |
20160055205 | Jonathan et al. | Feb 2016 | A1 |
20160253679 | Venkatraman et al. | Sep 2016 | A1 |
20160261411 | Yau | Sep 2016 | A1 |
20160328641 | Alsaud et al. | Nov 2016 | A1 |
20160342750 | Alstad et al. | Nov 2016 | A1 |
20160342751 | Alstad et al. | Nov 2016 | A1 |
20170060856 | Turtle | Mar 2017 | A1 |
20170091397 | Shah | Mar 2017 | A1 |
20170103164 | Dunlevy et al. | Apr 2017 | A1 |
20170103165 | Dunlevy et al. | Apr 2017 | A1 |
20170132621 | Miller et al. | May 2017 | A1 |
20170351821 | Tanner et al. | Dec 2017 | A1 |
20170372300 | Dunlevy et al. | Dec 2017 | A1 |
20180082183 | Hertz | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
2478440 | Oct 2013 | GB |
2002-189909 | Jul 2002 | JP |
2003-303232 | Oct 2003 | JP |
2008-234381 | Oct 2008 | JP |
2011-054045 | Mar 2011 | JP |
WO 2012122065 | Sep 2012 | WO |
Entry |
---|
Ahlswede et al., Network Information Flow, IEEE Transactions on Information Theory, vol. 46, No. 4; Jul. 2000 (13 pgs.). |
Bhattacharya, Indrajit and Getoor, Lise, Entity Resolution in Graphs,Department of Computer Science, University of Maryland (2005) (21 pgs.). |
Chen et al., Adaptive Graphical Approach to Entity Resolution, Jun. 18-23, 2007, Proceedings of the 7th ACM/IEEE-CS Joint Conference on Digital Libraries, pp. 204-213 (10 pgs.). |
Christen, Data Matching, Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection, © Springer-Verlag Berlin Heidelberg, 2012 (279 pgs.). |
Cohen et al., A Comparison of String Metrics for Matching Names and Records, © 2003, American Association for Artificial Intelligence (www.aaai.org) (6 pgs.). |
Coleman et al., Medical Innovation—a diffusion study; The Bobbs-Merrill Company, Inc., 1966 (248 pgs.). |
Domingos et al., Mining High-Speed Data Streams, (2000) (10 pgs.). |
Greenhalgh et al., Diffusion of Innovations in Health Service Organisations—a systematic literature review, Blackwell Publishing, 2005 (325 pgs.). |
Jackson et al., The Evolution of Social and Economic Networks, Journal of Economic Theory 106, pp. 265-295, 2002 (31 pgs.). |
Jackson, Matthew O., Social and Economic Networks, Princeton University Press, 2008 (509 pgs.). |
Krempl et al., Open Challenges for Data Stream Mining Research, SIGKDD Explorations, vol. 16, Issue 1, Jun. 2014 (64 pgs.). |
Lin et al., A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering, © Elsevier, 2005 (26 pgs.). |
Rebuge, Business Process Analysis in Healthcare Environments, 2011, Ellsevier Ltd., pp. 99-116 (18 pgs.). |
Wasserman et al., Social Network Analysis: Methods and Applications, Cambridge University Press; 1994 (434 pgs.). |
White et al., Algorithms for Estimating Relative Importance in Networks, Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003 (10 pgs.). |
(MATHJAX), Naive Bayes Categorisation (with some help from Elasticsearch), blog post dated Dec. 29, 2013 (https://blog.wtf.sg/2013/12/29/naive-bayes-categorisation-with-some-help-from-elasticsearch/). (8 pgs.). |
Webpage: New Health Care Electronic Transactions Standards Versions 5010, D.0, and 3.0, Jan. 2010 ICN 903192; http://www.cms.gov/Regulations-and-Guidance/HIPAA-Adminstrative-Simplification/Versions5010and D0/downloads/w5010BasicsFctCht.pdf (4 pgs.). |
Webpage: U.S. Dept. Of Health and Human Services, Guidance Regarding Methods for De-identification of Protected Health Information in Accordance with the Health Insurance Portability and Accountability Act (HIPAA) Privacy Rule, http://www.hhs.gov/ocr/privacy/hipaa/understanding/coveredentities/De-identification/guidance.html printed Oct. 15, 2015 (14 pgs.). |
Anonymous: “Oauth—Wikipedia”, Sep. 23, 2013. Retrieved from the Internet URL:https://en.wikipedia.org/w/index.php?title+oAuth&oldid+574187532 (3 pages). |
Version 5010 and D.O, Center for Medicare & Medicaid Services (2 pgs.). |
Anonymous: “Oauth” Wikipedia—Retrieved from the Internet URL:https://en.wikipedia.org/wiki/Oauth (8 pgs.). |
Number | Date | Country | |
---|---|---|---|
20170039330 A1 | Feb 2017 | US |
Number | Date | Country | |
---|---|---|---|
62200272 | Aug 2015 | US |