# US 2023/0274146 A1 · Information processing apparatus, information processing method, and storage medium

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

- Number: US 2023/0274146 A1
- Document ID: US20230274146A1
- Status: Published application
- Kind: A1
- Application number: 17/931,879
- Filed: 2022-09-13
- Published: 2023-08-31
- Earliest claimed: 2022-02-25
- Assignees: Kabushiki Kaisha Toshiba
- Applicants: Kabushiki Kaisha Toshiba
- Inventors: Yasutoyo TAKEYAMA; Yoshiyuki KOKOJIMA
- Web page: https://patentgrep.com/patent/US20230274146A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 18/213: Feature extraction, e.g. by transforming the feature space; Summarisation; Mappings, e.g. subspace methods
- G06F 16/9027: {Trees}
- G06F 18/29: {Graphical models, e.g. Bayesian networks}
- G06F 40/237: Lexical tools
- G06F 40/30: Semantic analysis
- G06N 3/045: Combinations of networks
- G06N 3/08: Learning methods
- G06N 3/082: modifying the architecture, e.g. adding, deleting or silencing nodes or connections
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

In general, according to one embodiment, an information processing apparatus includes a processor. The processor includes hardware configured to extract a sub-graph that is a graph structure operating independently from data of an input graph structure including a plurality of nodes and an edge connecting the nodes, extract a path from the extracted sub-graph, and perform learning of an embedding model using the extracted path. The embedding model performs embedding on data of a graph structure.

## Claims

### Claim 1

An information processing apparatus comprising:
a processor including hardware configured to
extract a sub-graph that is a graph structure operating independently from data of an input graph structure including a plurality of nodes and an edge connecting the nodes,
extract a path from the extracted sub-graph, and
perform learning of an embedding model using the extracted path, the embedding model performing embedding on data of a graph structure.

### Claim 2 (depends on 1)

The information processing apparatus according to claim 1, wherein
the processor
extracts one or more closed circuits in data of the input graph structure,
determines presence or absence of a node including a part that is capable of operating as power for each extracted closed circuit, and
extracts, as the sub-graph, a graph structure having a node including a part that is capable of operating as the power.

### Claim 3 (depends on 1)

The information processing apparatus according to claim 1, wherein
the processor
inputs test data to a program represented by data of the input graph structure,
records information on a combination of nodes corresponding to processing of the program operated by the input test data, and
extracts, as the sub-graph, a combination of the nodes operated a large number times.

### Claim 4 (depends on 1)

The information processing apparatus according to claim 1, wherein
the processor randomly extracts a predetermined number of the paths from the sub-graph.

### Claim 5 (depends on 1)

The information processing apparatus according to claim 1, wherein
the embedding model is a model of word2vec or a model of ngram2vec.

### Claim 6

An information processing method comprising:
extracting a sub-graph that is a graph structure operating independently from data of an input graph structure including a plurality of nodes and an edge connecting the nodes,
extracting a path from the extracted sub-graph, and
performing learning of an embedding model using the extracted path, the embedding model performing embedding on data of a graph structure.

### Claim 7

A non-transitory computer-readable storage medium storing a computer-readable information processing program for causing a computer to execute
extracting a sub-graph that is a graph structure operating independently from data of an input graph structure including a plurality of nodes and an edge connecting the nodes,
extracting a path from the extracted sub-graph, and
performing learning of an embedding model using the extracted path, the embedding model performing embedding on data of a graph structure.
