Representing graph edges using neural networks
US-11455512-B1 · Sep 27, 2022 · US
US2023134742A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2023134742-A1 |
| Application number | US-202218087704-A |
| Country | US |
| Kind code | A1 |
| Filing date | Dec 22, 2022 |
| Priority date | May 18, 2018 |
| Publication date | May 4, 2023 |
| 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.
There is described a neural network system implemented by one or more computers for determining graph similarity. The neural network system comprises one or more neural networks configured to process an input graph to generate a node state representation vector for each node of the input graph and an edge representation vector for each edge of the input graph; and process the node state representation vectors and the edge representation vectors to generate a vector representation of the input graph. The neural network system further comprises one or more processors configured to: receive a first graph; receive a second graph; generate a vector representation of the first graph; generate a vector representation of the second graph; determine a similarity score for the first graph and the second graph based upon the vector representations of the first graph and the second graph.
Opening claim text (preview).
What is claimed is: 1 . A neural network system implemented by one or more computers for determining graph similarity, the neural network system comprising: one or more neural networks configured to: process an input graph to generate a node state representation vector for each node of the input graph and an edge representation vector for each edge of the input graph; and process the node state representation vectors and the edge representation vectors to generate a vector representation of the input graph; one or more processors configured to: receive a first graph; receive a second graph; generate a vector representation of the first graph using the one or more neural networks; generate a vector representation of the second graph using the one or more neural networks; determine a similarity score for the first graph and the second graph based upon the vector representations of the first graph and the second graph.
Learning methods · CPC title
characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU] · CPC title
Auto-encoder networks; Encoder-decoder networks · CPC title
Supervised learning · CPC title
by source code analysis · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.