Lineage diagram abstract method based on node structure similarity and semantic proximity
A technology of node structure and lineage graph, applied in the field of lineage graph, which can solve problems such as difficult to understand and huge results.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0072] See appendix 1 for the implementation pseudocode of the genealogy graph summary method based on node structure similarity and semantic proximity proposed by the present invention.
[0073] The complexity of the above training algorithm is O(|V||E|+|C|^2+|D|^2), where |V| is the number of nodes in the lineage graph, |E| is the number of edges in the lineage graph, |C| is the set size of activities that may output the same, and |D| is the number of data nodes in the lineage graph. The time complexity of the algorithm is polynomial time complexity, which is acceptable.
[0074] Based on the logic of the above algorithm, the present invention uses 36 successful running scientific workflow lineages of Taverna provenance to synthesize a lineage graph data set with 1502 nodes and 1598 edges, and on the basis of this data set, it tests the Variation of the pruning gain for a variation of the class threshold σ. The pruning gain is used to evaluate how compact the post-digest l...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


