search

yao8839836 / kg-bert

KG-BERT: BERT for Knowledge Graph Completion
Apache License 2.0
679 stars 141 forks source link

Time complexity of test triple ranking #31

Closed xyjigsaw closed 2 years ago

xyjigsaw commented 2 years ago

Hi there, you mentioned that

Each correct test triple (h, r, t) is corrupted by replacing either its head or tail entity with every entity $e \in E$.

which means, in my opinion, the time complexity of $N$ test triples ranking is $N \times |E|$. I wonder whether it is time-consuming?

yao8839836 commented 2 years ago

@xyjigsaw Yes, it‘s time-consuming in the evaluation phase. The limitation has been addressed in https://arxiv.org/abs/2004.14781

xyjigsaw commented 2 years ago

Thank you for your quick response.