Neural Network Medical Coding Using Hierarchical Semantic Weights

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods for medical coding, such as those using MedDRA, are challenging due to the complexity and richness of healthcare domains, often omitting significant portions of adverse event citations, and traditional approaches struggle with the large number of possible codes and fine-grained semantic differences.

Innovation Solution

A neural network architecture that leverages hierarchical semantics between medical concepts in medical dictionaries is implemented, with a medical coding engine configured to include layers of preferred terminology (PT) and lowest level terminology (LLT) nodes, using weighted connections to improve code assignment accuracy by exploiting semantic similarities and increasing the effective usage of labelled data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If traditional string matching or rule-based techniques are used for medical coding, then implementation simplicity is maintained, but coding accuracy deteriorates due to omission of significant portions of adverse event citations

Engineering Contradiction:
Improveimplementation simplicityVSAvoidcoding accuracy
Core Design Contradiction:
Ease of manufactureVSMeasurement precision

Solution Approach 1:

The patent replaces traditional mechanical string matching and rule-based techniques with a neural network system that uses learned semantic representations. The neural network processes adverse event citations by transforming them into vector embeddings and comparing them with coded event embeddings, enabling the system to capture semantic meaning rather than relying on exact string matches or predefined rules.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The patent changes the parameter space from discrete string matching to continuous vector space embeddings. By representing both adverse event citations and coded events as vectors in a high-dimensional space, the system can measure semantic similarity through distance metrics, allowing for more nuanced and accurate matching that captures subtle semantic differences between medical terms.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If all possible LLT nodes are traversed to ensure complete code coverage, then coding completeness is improved, but processing time and computational complexity increase significantly

Engineering Contradiction:
Improvecoding completenessVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent performs preliminary action by pre-computing embeddings for all coded events in the medical dictionary and storing them in a reference database. When a new adverse event citation needs to be coded, the system only needs to compute the embedding for that single citation and compare it against the pre-computed embeddings, rather than traversing and evaluating all possible code nodes in the medical dictionary hierarchy.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces vector embeddings as an intermediary representation layer between the raw adverse event citation text and the discrete medical codes. This embedding layer acts as a mediator that transforms the coding problem from a discrete search through all possible codes into a continuous similarity search, enabling efficient retrieval of the most appropriate codes without exhaustive traversal.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Measurement precision

If highly trained domain experts perform manual coding to achieve high accuracy, then coding precision is improved, but productivity and scalability deteriorate

Engineering Contradiction:
Improvecoding precisionVSAvoidcoding throughput
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent implements self-service by training the neural network to automatically learn the complex mapping between adverse event citations and medical codes without requiring human experts to perform each coding task manually. The system uses training data annotated by experts to learn the coding patterns, then autonomously performs coding on new data, maintaining high accuracy while achieving scalable automation.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent incorporates feedback mechanisms where the neural network is trained on labeled data from expert-coded examples, using the expert annotations as ground truth to guide learning. The system continuously improves its coding accuracy by learning from these feedback signals, capturing the expertise of human coders in a reusable computational model that can process unlimited numbers of citations.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11176441B2Neural network architecture for performing medical coding
Publication Date: 2021.11.16 MERATIVE US LP
  • US11176441B2 patent drawing
  • US11176441B2 patent drawing
  • US11176441B2 patent drawing

AI summary

Mechanisms are provided to implement a medical coding engine to perform medical coding using a neural network architecture that leverages hierarchical semantics between medical concepts. The medical coding engine configures a medical coding neural network to comprise an first layer of nodes comprising preferred terminology (PT) nodes, a second layer comprising lowest level terminology (LLT) nodes, and a third layer comprising weighted values for each connection between each PT node and each LLT node forming a PT node/LLT node connection. Responsive to receiving an adverse event from a cognitive system, a PT node is identified in the first layer associated with a citation from the adverse event. One or more nodes are identified from the second layer based on the identification PT node and a weight associated with the PT node/LLT node connection. A medical code associated with each the one or more LLT nodes is then output.