News
This repository illustrated the usage of the NetworkX functions (graph_edit_distance and optimal_edit_paths) in Pattern Recognition. graph_edit_distance returns the distance between two graphs (G1 and ...
we give a comparison between the mentioned loss functions and the Softmax loss function. We also present the comparisons of results using different graph edit distance (GED) methods. Our quantitative ...
Graph Edit Distance optimized with Greedy Algorithm for Similarity Search in Business Process Graphs
BPG is a model that search the similarity node using Graph Edit Distance (GED) concept. Measurement of the distance that optimized using greedy algorithm to reduce NP-Problem from GED. The experiment ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback