An approach for approximate subgraph matching in domain knowledge graph (Q3389104)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approach for approximate subgraph matching in domain knowledge graph |
scientific article; zbMATH DE number 7346392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approach for approximate subgraph matching in domain knowledge graph |
scientific article; zbMATH DE number 7346392 |
Statements
7 May 2021
0 references
subgraph matching
0 references
node filtering
0 references
matching cost
0 references
sorting mechanism
0 references
0.7644296884536743
0 references
0.7349748611450195
0 references
0.7278051376342773
0 references
0.7017397880554199
0 references
0.6941230297088623
0 references
