# US 2025/0165814 A1 · Domain knowledge utilization system, domain knowledge utilization method, and domain knowledge utilization program

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

- Number: US 2025/0165814 A1
- Document ID: US20250165814A1
- Status: Published application
- Kind: A1
- Application number: 18/841,863
- Filed: 2022-09-08
- Published: 2025-05-22
- Earliest claimed: 2022-03-01
- Assignees: Hitachi, Ltd.
- Applicants: Hitachi, Ltd.
- Inventors: Kazuki Horiwaki; Kazuo Muto
- Web page: https://patentgrep.com/patent/US20250165814A1

## CPC

- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06N 3/08: Learning methods
- G06N 20/00: Machine learning
- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- 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

## Abstract

In a domain knowledge utilization system in which a utilization algorithm for utilizing domain knowledge described by a graph for construction and training of a prediction model can be selected, a utilization algorithm that is selectable by an algorithm selection unit includes at least one or more of a first utilization algorithm using a feature derived from the graph as an explanatory variable of the prediction model, a second utilization algorithm applying a relationship between nodes in the graph to a relationship between explanatory variables of the prediction model, and a third utilization algorithm applying a definition of a node in the graph to a training condition of the prediction model.

## Claims

### Claim 1

A domain knowledge utilization system comprising:
a graph description unit configured to describe domain knowledge about a target system as a definition of a node or an edge in a graph including nodes and edges indicating a relationship between nodes;
a model construction unit configured to perform construction and training of a prediction model for predicting a response variable based on an explanatory variable for the target system; and
an algorithm selection unit configured to select a utilization algorithm for utilizing domain knowledge described by the graph for construction and training of the prediction model, wherein
a utilization algorithm that is selectable by the algorithm selection unit includes at least one or more of a first utilization algorithm using a feature derived from the graph as an explanatory variable of the prediction model, a second utilization algorithm applying a relationship between nodes in the graph to a relationship between explanatory variables of the prediction model, and a third utilization algorithm applying a definition of a node in the graph to a training condition of the prediction model.

### Claim 2 (depends on 1)

The domain knowledge utilization system according to claim 1, further comprising:
a graph storage unit configured to store a definition of a node and an edge in the graph described by the graph description unit as graph data; and
a data storage unit configured to store data of the target system associated with a node in the graph as target data, wherein
a data item of the target data is included as an explanatory variable of the prediction model.

### Claim 3 (depends on 2)

The domain knowledge utilization system according to claim 2, further comprising:
an algorithm processing unit configured to perform, according to a utilization algorithm selected by the algorithm selection unit, preprocessing of the graph data stored in the graph storage unit and/or the target data stored in the data storage unit, wherein
when the first utilization algorithm is selected by the algorithm selection unit, the algorithm processing unit extracts a latent variable of the graph as the feature using the graph data and the target data.

### Claim 4 (depends on 1)

The domain knowledge utilization system according to claim 1, wherein
a node in the graph includes an observation variable node representing a data item observable from the target system, a control variable node representing a data item used as a control item in the target system, a disturbance node representing a disturbance of the target system, and a block node representing a relationship between nodes in the target system.

### Claim 5

A domain knowledge utilization method comprising:
a first step of showing domain knowledge about a target system as a definition of a node or an edge in a graph including nodes and edges indicating a relationship between nodes;
a second step of performing construction and training of a prediction model for predicting a response variable based on an explanatory variable for the target system; and
a third step of selecting a utilization algorithm for utilizing domain knowledge described by the graph for construction and training of the prediction model, wherein
a utilization algorithm that is selectable in the third step includes at least one or more of a first utilization algorithm using a feature derived from the graph as an explanatory variable of the prediction model, a second utilization algorithm applying a relationship between nodes in the graph to a relationship between explanatory variables of the prediction model, and a third utilization algorithm applying a definition of a node in the graph to a training condition of the prediction model.

### Claim 6 (depends on 5)

The domain knowledge utilization method according to claim 5, wherein
a definition of a node and an edge in the graph described by the first step is stored as graph data,
data of the target system associated with a node in the graph is stored as target data, and
a data item of the target data is included as an explanatory variable of the prediction model.

### Claim 7 (depends on 6)

The domain knowledge utilization method according to claim 6, further comprising:
a fourth step of performing preprocessing of the graph data and/or the target data according to a utilization algorithm selected in the third step, wherein
when the first utilization algorithm is selected in the third step, in the fourth step, a latent variable of the graph is extracted as the feature using the graph data and the target data.

### Claim 8 (depends on 5)

The domain knowledge utilization method according to claim 5, wherein
a node in the graph includes an observation variable node representing a data item observable from the target system, a control variable node representing a data item used as a control item in the target system, a disturbance node representing a disturbance of the target system, and a block node representing a relationship between nodes in the target system.

### Claim 9

A domain knowledge utilization program causing a computer to execute
a first procedure of showing domain knowledge about a target system as a definition of a node or an edge in a graph including nodes and edges indicating a relationship between nodes;
a second procedure of performing construction and training of a prediction model for predicting a response variable based on an explanatory variable for the target system; and
a third procedure of selecting a utilization algorithm for utilizing domain knowledge described by the graph for construction and training of the prediction model, wherein
a utilization algorithm that is selectable in the third procedure includes at least one or more of a first utilization algorithm using a feature derived from the graph as an explanatory variable of the prediction model, a second utilization algorithm applying a relationship between nodes in the graph to a relationship between explanatory variables of the prediction model, and a third utilization algorithm applying a definition of a node in the graph to a training condition of the prediction model.

### Claim 10 (depends on 9)

The domain knowledge utilization program according to claim 9, wherein
a definition of a node and an edge in the graph described by the first procedure is stored as graph data,
data of the target system associated with a node in the graph is stored as target data, and
a data item of the target data is included as an explanatory variable of the prediction model.

### Claim 11 (depends on 10)

The domain knowledge utilization program according to claim 10 further causing a computer to execute
a fourth procedure of performing preprocessing of the graph data and/or the target data according to a utilization algorithm selected in the third procedure, wherein
when the first utilization algorithm is selected in the third procedure, in the fourth procedure, a latent variable of the graph is extracted as the feature using the graph data and the target data.

### Claim 12 (depends on 9)

The domain knowledge utilization program according to claim 9, wherein
a node in the graph includes an observation variable node representing a data item observable from the target system, a control variable node representing a data item used as a control item in the target system, a disturbance node representing a disturbance of the target system, and a block node representing a relationship between nodes in the target system.
