# US 2025/0378409 A1 · Strategic and Tactical Intelligence in Dynamic Segmentation

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

- Number: US 2025/0378409 A1
- Document ID: US20250378409A1
- Status: Published application
- Kind: A1
- Application number: 19/307,664
- Filed: 2025-08-22
- Published: 2025-12-11
- Earliest claimed: 2021-05-07
- Assignees: Blue Yonder Group, Inc.
- Applicants: Blue Yonder Group, Inc.
- Inventors: Ganesh Muthusamy; Phani Bulusu; Rashid Puthiyapurayil; Abhishek Singh
- Web page: https://patentgrep.com/patent/US20250378409A1

## CPC

- G06Q 30/0204: Market segmentation
- G06F 16/215: Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
- G06F 18/2137: based on criteria of topology preservation, e.g. multidimensional scaling or self-organising maps
- G06N 20/00: Machine learning
- G06Q 10/0633: Workflow analysis
- G06Q 10/0637: Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
- G06Q 30/0201: Market modelling; Market analysis; Collecting market data
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A system and method for performing strategic segmentation including a supply chain network having a strategic segmentation planner, an inventory system, a transportation network and supply chain entities. The strategic segmentation planner includes a computer having a memory and a processor, that selects a workflow depth including an amount of data to analyze, discovers features by analyzing cleansed data to locate features which are characterized by features data, pre-processes the features data to standardize the features data, performs multi-dimension segmentation by computing feature importance to generate multi-dimensional segments, assigns policy parameters to the supply chain network based on the generated multi-dimensional segments, and trains a machine learning model by applying a cyclic boosting process to the standardized features data wherein the cyclic boosting process iteratively learns relationships associated with the generated multi-dimensional segments.

## Claims

### Claim 1

A system for performing comprehensive segment analysis, comprising:
a computer, the computer comprising a memory and a processor, the computer configured to:
select an algorithm with which to perform autonomous multi-dimensional segmentation;
in response to receiving a selection to perform the autonomous multi-dimensional segmentation:
perform the autonomous multi-dimensional segmentation and compute a number of segments autonomously;
store the autonomously computed number of segments; and
generate one or more GUI displays visualizing the autonomously computed number of segments;
in response to receiving a selection to receive a specified number of segments:
receive data for the specified number of segments; and
access the specified number of segments data and generate an initial segmentation configuration using the specified number of segments data;
generate a GUI display visualizing an initial segmentation configuration;
access the initial segmentation configuration and pre-processed data, and assign segments from the initial segmentation configuration to intersections;
compute a relative importance score for each of one or more features associated with the assigned segments; and
drop any of the one or more features with a relative importance score below a threshold.

### Claim 2 (depends on 1)

The system of claim 1, wherein the algorithm is selected based on whether data stored in the pre-processed data is string-based or numerical-based.

### Claim 3 (depends on 1)

The system of claim 1, wherein the intersections comprise item and product intersections.

### Claim 4 (depends on 1)

The system of claim 1, wherein the GUI display visualizing the initial segmentation configuration comprises a graph of the assigned segments and the one or more features.

### Claim 5 (depends on 1)

The system of claim 1, wherein the computer is further configured to:
generate a GUI display to visualize the one or more relative importance scores for the one or more features.

### Claim 6 (depends on 1)

The system of claim 1, wherein the relative importance score for each of the one or more features are computed using a boundary analysis.

### Claim 7 (depends on 1)

The system of claim 1, wherein the computer is further configured to:
standardize units of measure or currency for each of the one or more features.

### Claim 8

A computer-implemented method for performing comprehensive segment analysis, comprising:
selecting, by a computer comprising a memory and a processor, an algorithm with which to perform autonomous multi-dimensional segmentation;
in response to receiving, by the computer, a selection to perform the autonomous multi-dimensional segmentation:
performing, by the computer, the autonomous multi-dimensional segmentation and computing, by the computer, a number of segments autonomously;
storing, by the computer, the autonomously computed number of segments; and
generating, by the computer, one or more GUI displays visualizing the autonomously computed number of segments;
in response to receiving, by the computer, a selection to receive a specified number of segments:
receiving, by the computer, data for the specified number of segments; and
accessing, by the computer, the specified number of segments data and generating, by the computer, an initial segmentation configuration using the specified number of segments data;
generating, by the computer, a GUI display visualizing an initial segmentation configuration;
accessing, by the computer, the initial segmentation configuration and pre-processed data, and assigning, by the computer, segments from the initial segmentation configuration to intersections;
computing, by the computer, a relative importance score for each of one or more features associated with the assigned segments; and
dropping, by the computer, any of the one or more features with a relative importance score below a threshold.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein the algorithm is selected based on whether data stored in the pre-processed data is string-based or numerical-based.

### Claim 10 (depends on 8)

The computer-implemented method of claim 8, wherein the intersections comprise item and product intersections.

### Claim 11 (depends on 8)

The computer-implemented method of claim 8, wherein the GUI display visualizing the initial segmentation configuration comprises a graph of the assigned segments and the one or more features.

### Claim 12 (depends on 8)

The computer-implemented method of claim 8, further comprising:
generating, by the computer, a GUI display to visualize the one or more relative importance scores for the one or more features.

### Claim 13 (depends on 8)

The computer-implemented method of claim 8, wherein the relative importance score for each of the one or more features are computed using a boundary analysis.

### Claim 14 (depends on 8)

The computer-implemented method of claim 8, further comprising:
standardizing, by the computer, units of measure or currency for each of the one or more features.

### Claim 15

A non-transitory computer-readable medium embodied with software for performing comprehensive segment analysis, the software when executed using one or more computers is configured to:
select an algorithm with which to perform autonomous multi-dimensional segmentation;
in response to receiving a selection to perform the autonomous multi-dimensional segmentation:
perform the autonomous multi-dimensional segmentation and compute a number of segments autonomously;
store the autonomously computed number of segments; and
generate one or more GUI displays visualizing the autonomously computed number of segments;
in response to receiving a selection to receive a specified number of segments:
receive data for the specified number of segments; and
access the specified number of segments data and generate an initial segmentation configuration using the specified number of segments data;
generate a GUI display visualizing an initial segmentation configuration;
access the initial segmentation configuration and pre-processed data, and assign segments from the initial segmentation configuration to intersections;
compute a relative importance score for each of one or more features associated with the assigned segments; and
drop any of the one or more features with a relative importance score below a threshold.

### Claim 15 (depends on 15)

transitory computer-readable medium of claim 15, wherein the intersections comprise item and product intersections.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the algorithm is selected based on whether data stored in the pre-processed data is string-based or numerical-based.

### Claim at position 18



### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the GUI display visualizing the initial segmentation configuration comprises a graph of the assigned segments and the one or more features.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, the software further configured to:
generate a GUI display to visualize the one or more relative importance scores for the one or more features.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the relative importance score for each of the one or more features are computed using a boundary analysis.
