# US 2026/0087375 A1 · Decision Tree Algorithms in Machine Learning To Learn and To Predict Innovations

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0087375 A1
- Document ID: US20260087375A1
- Status: Published application
- Kind: A1
- Application number: 19/253,892
- Filed: 2025-06-29
- Published: 2026-03-26
- Earliest claimed: 2022-07-19
- Inventors: Marguerite Johnson
- Web page: https://patentgrep.com/patent/US20260087375A1

## CPC

- G06F 16/9027: {Trees}
- G06N 20/00: Machine learning
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

An expert system for innovation discovery in the field of artificial intelligence (AI) applies decision tree algorithms structured around a rules-based reasoning methodology. The system trains on innovation datasets comprising both data and non-data types, including target variables representing key attributes of innovations and proximal variables that approximate them. Through a machine learning architecture, decision nodes are configured to evaluate these variables and generate predictive models. The architecture enables continual learning via reinforcement mechanisms and communication ports that facilitate data flow from external tools, cloud storage, and software. Differentiated nodes are assigned weights, roles, and activation logic to refine decision-making and improve model accuracy. The expert system integrates human-defined heuristic rules with AI capabilities to support early-stage ideation, concept development, and innovation pattern recognition. This system can operate as an autonomous AI agent, a core reasoning engine, or as part of a digital business model in platform ecosystems to enhance innovation discovery, reduce hallucinations, and support transparent, verifiable AI outcomes.

## Claims

### Claim 1

Decision Tree Algorithms comprising:
Training the decision tree on datasets containing categories and classifications that can be non-data and data types;
Target Variables defining key attributes of innovations that can be non-data and data types;
Proximal Variables are approximated attributes of Target Variables; and
Nodes that are configured to train and create predictive models.

### Claim 2 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Target Variables are innovations in categories.

### Claim 3 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Target Variables are innovations in classifications.

### Claim 4 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Proximal Variables are innovations in categories.

### Claim 5 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Proximal Variables are innovations in classifications.

### Claim 6 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Proximal Variables share attributes with Target Variables.

### Claim 7 (depends on 1)

Decision Tree Algorithms in claim 1, wherein predictive models can be combined.

### Claim 8 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Nodes have defined parameters.

### Claim 9 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Nodes have approximated parameters.

### Claim 10 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Nodes are in a specific order of operation.

### Claim 11 (depends on 1)

Decision Tree Algorithms in claim 1, wherein Nodes maintain specific order throughout cycles.

### Claim 12 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising Nodes that are configured to multiple decision tree algorithms.

### Claim 13 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising Nodes that are configured to follow a specific pattern.

### Claim 14 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising Nodes that are configured to multiple decision tree algorithms.

### Claim 15 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising Nodes that intersect Target Variables and Proximal Variables.

### Claim 16 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising Nodes that can be independent.

### Claim 17 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising Nodes that can be conditional.

### Claim 18 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising an encoder that encrypts the datasets and models.

### Claim 19 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising a decoder configured to decipher the encoder.

### Claim 20 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising reinforced learning and training on datasets.

### Claim 21 (depends on 1)

Decision Tree Algorithms in claim 1, further comprising deep learning and practicing on datasets.

### Claim 22 (depends on 1)

Decision Tree Algorithms in claim 1, therein perform their functionalities in a digital platform business model.

### Claim 23 (depends on 14)

Decision Tree Algorithms in claim 14, further comprising a digital platform business model with multiple parties interacting.

### Claim 24 (depends on 14)

Decision Tree Algorithms in claim 14, further comprising a digital platform business model with networked ecosystems of parties interacting.

### Claim 25

Decision Tree Algorithms comprising:
Categories and Classifications of innovation information received through ports;
Target Variables defining key attributes of innovations that can be non-data and data types;
Proximal Variables are approximated attributes of Target Variables; and
Nodes that are configured to train and create predictive models.

### Claim 26 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Target Variables are innovations in categories.

### Claim 27 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Target Variables are innovations in classifications.

### Claim 28 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Proximal Variables are innovations in categories.

### Claim 29 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Proximal Variables are innovations in classifications.

### Claim 30 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Proximal Variables share attributes with Target Variables.

### Claim 31 (depends on 25)

Decision Tree Algorithms in claim 25, wherein predictive models can be combined.

### Claim 32 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Nodes have defined parameters.

### Claim 33 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Nodes have approximated parameters.

### Claim 34 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Nodes are in a specific order of operation.

### Claim 35 (depends on 25)

Decision Tree Algorithms in claim 25, wherein Nodes maintain specific order throughout cycles.

### Claim 36 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising Nodes that are configured to multiple decision tree algorithms.

### Claim 37 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising Nodes that are configured to follow a specific pattern.

### Claim 38 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising Nodes that are configured to multiple decision tree algorithms.

### Claim 39 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising Nodes that intersect Target Variables and Proximal Variables.

### Claim 40 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising Nodes that can be independent.

### Claim 41 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising Nodes that can be conditional.

### Claim 42 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising an encoder that encrypts the datasets and models.

### Claim 43 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising a decoder configured to decipher the encoder.

### Claim 44 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising reinforced learning and training on datasets.

### Claim 45 (depends on 25)

Decision Tree Algorithms in claim 25, further comprising deep learning and practicing on datasets.

### Claim 46 (depends on 25)

Decision Tree Algorithms in claim 25, therein perform their functionalities in a digital platform business model.

### Claim 47 (depends on 36)

Decision Tree Algorithms in claim 36, further comprising a digital platform business model with multiple parties interacting.

### Claim 48 (depends on 36)

Decision Tree Algorithms in claim 36, further comprising a digital platform business model with networked ecosystems of parties interacting.
