Middleton Reutlinger
Code change graph node matching with machine learning
Implementations are described herein for training and using machine learning to determine mappings between matching nodes of graphs representing predecessor source code snippets and graphs representing successor source code snippets. In various implementations, first and second graphs may be obtained, wherein the first graph represents a predecessor source code snippet and the second graph represents a successor source code snippet. The first graph and the second graph may be applied as inputs across a trained machine learning model to generate node similarity measures between individual nodes of the first graph and nodes of the second graph. Based on the node similarity measures, a mapping may be determined across the first and second graphs between pairs of matching nodes.
X DEVELOPMENT LLC
G G G G G G G
G06F G06N G06F G06N G06N G06N G06N
inventional inventional inventional inventional inventional inventional inventional
Catalina Codruta Qianyu
Cangea Zhang