# US 2026/0087302 A1 · Unified graph transformer for financial fraud detection on massive graphs

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

- Number: US 2026/0087302 A1
- Document ID: US20260087302A1
- Status: Published application
- Kind: A1
- Application number: 18/892,332
- Filed: 2024-09-20
- Published: 2026-03-26
- Earliest claimed: 2024-09-20
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation; Massachusetts Institute of Technology
- Inventors: YADA ZHU; Xiaojie Guo; Junhong Lin; Shuaicheng Zhang; Julian Shun
- Web page: https://patentgrep.com/patent/US20260087302A1

## CPC

- G06N 3/042: Knowledge-based neural networks; Logical representations of neural networks
- G06N 3/0499: Feedforward networks
- G06N 3/08: Learning methods
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer-implemented method for modeling graph-structured data using a graph transformer includes applying cross-type attention to a target node of the graph-structured data. The graph transformer is connected to a type-specific feed forward network to allow node features of different node types to be learned differently. Masked label embedding is applied to force learning and a prediction of a node label for a node having a masked label.

## Claims

### Claim 1

A computer-implemented method for modeling graph-structured data using a graph transformer, comprising:
applying cross-type attention to a target node of the graph-structured data;
connecting the graph transformer to a type-specific feed forward network to allow node features of different node types to be learned differently; and
applying masked label embedding to force learning and a prediction of a node label.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the graph-structured data is in a heterogeneous graph.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein the cross-type attention is cross-type heterogeneous attention that focuses on neighbors of the target node and utilizes node/edge type information in the graph-structured data.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, further comprising simultaneously allowing the target node to communicate with other nodes of different node types.

### Claim 5 (depends on 3)

The computer-implemented method of claim 3, further comprising applying projection matrices on the target node, having a given node type, to generate corresponding key-, query- and value projections to model connections between different types of nodes.

### Claim 6 (depends on 3)

The computer-implemented method of claim 3, further comprising applying an edge-type dependent transformation in the cross-type attention to allow modeling of diverse node relationships.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the graph-structured data is in a heterophilic graph.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, further comprising concatenating as input a randomly masked label embedding to explicitly force the graph transformer to learn and predict the node label.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, further comprising applying a cross-type attention mask for a node pair without an interconnecting edge to allows the target node to attend to neighbor nodes regardless of the node type.

### Claim 10

A system comprising:
a processor;
a data bus coupled to the processor;
a memory coupled to the data bus; and
a computer-usable medium embodying a computer program code, the computer program code comprising instructions executable by the processor and configured to:
apply cross-type attention to a target node of graph-structured data;
connect a graph transformer to a type-specific feed forward network to allow node features of different node types to be learned differently; and
apply masked label embedding to force learning and a prediction of a node label.

### Claim 11 (depends on 10)

The system of claim 10, wherein the graph-structured data is in a heterogeneous-heterophilic graph.

### Claim 12 (depends on 11)

The system of claim 11, wherein the cross-type attention is cross-type heterogeneous attention that focuses on neighbors of the target node and utilizes node/edge type information in the graph-structured data.

### Claim 13 (depends on 11)

The system of claim 11, wherein the instructions are further configured to simultaneously allow the target node to communicate with other nodes of different node types.

### Claim 14 (depends on 11)

The system of claim 11, wherein the instructions are further configured to apply projection matrices on the target node, having a given node type, to generate corresponding key-, query- and value projections to model connections between different types of nodes.

### Claim 15 (depends on 11)

The system of claim 11, wherein the instructions are further configured to apply an edge-type dependent transformation in the cross-type attention to allow modeling of diverse node relationships.

### Claim 16

A computer program product for modeling graph-structured data in a heterogeneous-heterophilic graph using a graph transformer, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to:
apply cross-type attention to a target node of the graph-structured data;
connect the graph transformer to a type-specific feed forward network to allow node features of different node types to be learned differently; and
apply masked label embedding to force learning and a prediction of a node label.

### Claim 17 (depends on 16)

The computer program product of claim 16, wherein the cross-type attention is cross-type heterogeneous attention that focuses on neighbors of the target node and utilizes node/edge type information in the graph-structured data.

### Claim 18 (depends on 16)

The computer program product of claim 16, wherein the program instructions are further configured to simultaneously allow the target node to communicate with other nodes of different node types.

### Claim 19 (depends on 16)

The computer program product of claim 16, wherein the program instructions are further configured to apply projection matrices on the target node, having a given node type, to generate corresponding key-, query- and value projections to model connections between different types of nodes.

### Claim 20 (depends on 16)

The computer program product of claim 16, wherein the program instructions are further configured to apply an edge-type dependent transformation in the cross-type attention to allow modeling of diverse node relationships.
