Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods? (Q6424817)
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: Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods? |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods? |
preprint article from arXiv |
Statements
30 January 2023
0 references
cs.LG
0 references
math.AT
0 references
Anson Bastos
0 references
Kuldeep Singh
0 references
Abhishek Nadgeri
0 references
Johannes Hoffart
0 references
Toyotaro Suzumura
0 references
Manish Singh
0 references
