Random Forest Classifier Flat Data Structure for Embedded Systems

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional random forest classifiers require significant processing resources, memory, and throughput, making them impractical for implementation in limited resource systems such as embedded software, health monitoring systems, and edge devices.

Innovation Solution

A data structure is used to implement a random forest classifier by converting decision trees into a pseudo regression model and translating the random forest into a flat format, allowing for a complex forest algorithm to be executed in resource-limited systems with reduced resource requirements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional random forest classifiers with decision trees and if-else statements are implemented, then classification accuracy is maintained, but processing resources and memory requirements increase significantly

Engineering Contradiction:
Improveclassification accuracyVSAvoidprocessing resources and memory
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments the random forest classifier into multiple independent decision trees, each handling a portion of the classification task. This segmentation allows the system to process data in smaller, more manageable units, reducing the memory footprint and processing overhead while maintaining overall classification accuracy through the collective decision-making of multiple trees.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transforms the traditional if-else statement structure into a parametric evaluation model where decision rules are represented as mathematical functions with adjustable parameters. This parameterization enables more efficient computation by replacing complex conditional logic with streamlined mathematical operations, reducing processing resources while preserving classification performance.

Inventive Principle:
Principle #35Parameter changes

2Adaptability or versatility

If traditional random forest classifiers are implemented in embedded systems, then comprehensive classification capabilities are achieved, but the system becomes impractical due to resource constraints

Engineering Contradiction:
Improveclassification capabilitiesVSAvoidresource feasibility
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The patent implements a simplified version of the random forest algorithm that uses a reduced number of decision trees and simplified evaluation rules compared to the traditional implementation. This partial action approach provides sufficient classification capability for embedded applications while dramatically reducing memory and processing requirements, making the system practical for resource-constrained environments.

Inventive Principle:
Principle #16Partial or excessive action

Solution Approach 2:

The patent employs lightweight data structures and temporary variables that are created and discarded during the classification process, rather than maintaining complex persistent structures. This approach minimizes memory allocation and deallocation overhead, enabling the classifier to operate efficiently within the limited memory constraints of embedded systems.

Inventive Principle:
Principle #27Cheap short-living objects (Disposable)

3Measurement precision

If decision trees with multiple if-else statements are used, then accurate classification decisions are made, but throughput and processing speed decrease

Engineering Contradiction:
Improveclassification accuracyVSAvoidthroughput and processing speed
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent replaces the mechanical if-else statement evaluation mechanism with a parametric mathematical evaluation system. Instead of sequentially checking multiple conditional statements, the system uses mathematical functions to evaluate decision rules, which can be computed more efficiently and in parallel, thereby increasing throughput while maintaining classification accuracy.

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

Solution Approach 2:

The patent pre-computes and stores decision thresholds and parameter values during the training phase, so that during classification, the system only needs to perform simple parameter comparisons and mathematical evaluations rather than complex logical reasoning. This preliminary preparation significantly speeds up the classification process while preserving accuracy.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20230237384A1Methods and apparatus to implement a random forest
Publication Date: 2023.07.27 GENERAL ELECTRIC CO
  • US20230237384A1 patent drawing
  • US20230237384A1 patent drawing
  • US20230237384A1 patent drawing

AI summary

Methods, apparatus, systems, and articles of manufacture to implement a random forest are disclosed. An example apparatus includes logic circuitry to, for a first cycle, identify a feature value corresponding to an initial node identifier of a data structure, the feature value including in an input feature array. The apparatus further includes a comparator to compare the feature value to a threshold corresponding to the initial node identifier. The apparatus further includes a register to store an updated node identifier, the updated node identifier being (a) a first updated node identifier when the feature value exceeds the threshold or (b) a second updated node identifier when the feature value is below the threshold, the logic circuitry to use the updated node identifier for a second cycle.