System for reducing transaction failure
US-12175472-B2 · Dec 24, 2024 · US
US2024256975A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2024256975-A1 |
| Application number | US-202118565585-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 18, 2021 |
| Priority date | Jun 2, 2021 |
| Publication date | Aug 1, 2024 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A computer-implemented method for event sequence forecasting of a process instance includes building up and training a three-layered prediction model including a first, a second and a third layer. The first layer is a graph embedding layer that assigns a fixed-dimensional graph embedding vector to each node and relation type in a fused event and knowledge graph that contains available structural information including events, knowledge graph nodes, and links between the events and the knowledge graph nodes. The second layer is an event embedding layer that assigns to each event of the process instance a fixed-dimensional event embedding vector. The third layer is a prediction layer that receives as input a sequence of event embeddings from the second layer and that generates as output a prediction of an unknown property of the event sequence used as input.
Opening claim text (preview).
1 . A computer-implemented method for event sequence forecasting of a process instance, the method comprising: building up and training a three-layered prediction model including a first, a second and a third layer, wherein the first layer is a graph embedding layer that assigns a fixed-dimensional graph embedding vector to each node and relation type in a fused event and knowledge graph that contains available structural information including events, knowledge graph nodes, and links between the events and the knowledge graph nodes, wherein the second layer is an event embedding layer that assigns to each event of the process instance a fixed-dimensional event embedding vector, and wherein the third layer is a prediction layer that receives as input a sequence of event embeddings from the second layer and that generates as output a prediction of an unknown property of the event sequence used as input. 2 . The method according to claim 1 , wherein the graph embedding layer is trained in an unsupervised manner. 3 . The method according to claim 1 , wherein the event embedding layer and the prediction layer are trained end-to-end in a supervised manner. 4 . The method according to claim 1 , wherein an event history containing previous event sequences with known outcomes is used as training samples for training the event embedding layer. 5 . The method according to claim 1 , wherein the event embedding layer determines the event embedding vectors by using a parametrized function that maps a graph neighborhood of any event in the fused event and knowledge graph to a fixed-dimensional vector. 6 . The method according to claim 5 , wherein the graph neighborhood of an event comprises a 2-hop neighborhood of the event. 7 . The method according to claim 1 , further comprising, upon arrival of a new event, using the trained prediction layer to dynamically update predictions. 8 . The method according to claim 7 , wherein updating predictions comprises: using the event embedding layer to compute an embedding of the event from the embeddings of the related nodes of the fused event and knowledge graph; and feeding the resulting embedding into the prediction layer to update the predictions about the event sequence. 9 . The method according to claim 1 , wherein the prediction layer generates the prediction output by using a transformer-based sequence model. 10 . The method according to claim 1 , further comprising: re-training the third layer, or the second and third layer, or all three layers, as soon as an amount of new events that has arrived exceeds a critical mass defined by a configurable threshold. 11 . The method according to claim 10 , wherein the configurable threshold defining the critical mass of new events is dynamically adjusted if a predictive accuracy drops below a certain threshold. 12 . The method according to claim 1 , further comprising: using the obtained predictions for automated decision making in a control loop. 13 . The method according to claim 12 , wherein the control loop is a closed control loop that receives as input a desired outcome, that uses the trained prediction model to predict the outcome for several possible actions, leading to several expected outcomes, and that includes a control element that selects these-actions that lead to an expected outcome having the smallest difference to the desired outcome. 14 . A system for event sequence forecasting of a process instance, the system comprising one or more processors configured to: build up and train a three-layered prediction model including a first, a second and a third layer, wherein the first layer is a graph embedding layer that assigns a fixed-dimensional graph embedding vector to each node and relation type in a fused event and knowledge graph that contains available structural information including events, knowledge graph nodes, and links between the events and the knowledge graph nodes, wherein the second layer is an event embedding layer that assigns to each event of the process instance a fixed-dimensional event embedding vector, and wherein the third layer is a prediction layer that receives as input a sequence of event embeddings from the second layer and that generates as output a prediction of an unknown property of the event sequence used as input. 15 . A tangible, non-transitory computer-readable medium having instructions thereon which, upon being executed by one or more processors, alone or in combination, provide for execution of the method according to claim 1 .
Supervised learning · CPC title
where the origin of the information is a central station · CPC title
for active traffic flow control · CPC title
Non-supervised learning, e.g. competitive learning · CPC title
Backpropagation, e.g. using gradient descent · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.