claim
LLM-based knowledge graph completion methods, such as the sequence-to-sequence model GenKGC and the text-graph hybrid model MADLINK, require exhaustive text processing and candidate scoring, resulting in high computational costs for large knowledge graphs.

Authors

Sources

Referenced by nodes (1)