Cognitive Knowledge Graph Reasoning for One-shot Relational Learning
Table 2: Inference time of CogKR and GMatching for different candidate numbers.
['Candidate Model', 'truncated (5,000) CogKR', 'truncated (5,000) GMatching', 'full (4,838,244) CogKR', 'full (4,838,244) GMatching']
We can see that when the candidate number is limited to 5000, the running time of GMatching is comparable to that of CogKR. However, when the candidate number is not limited, the running time of GMatching increases proportionally with the number of candidates, while the running time of CogKR remains the same. We make more discussion about the time complexity in the appendix.