Review Details
Reviewer has chosen to be Anonymous
Overall Impression: Average
Suggested Decision: Undecided
Technical Quality of the paper: Average
Presentation: Average
Reviewer`s confidence: High
Significance: Moderate significance
Background: Reasonable
Novelty: Limited novelty
Data availability: With exceptions that are admissible according to the data availability guidelines, all used and produced data are FAIR and openly available in established data repositories
Length of the manuscript: The length of this manuscript is about right
Summary of paper in a few sentences:
Knowledge Graph Embedding has become a promising approach for link prediction. Among the existing KGE approaches, tensor factorization based models (e.g., ComplEx, Distmult, etc) obtain state-of-the-art performance. The paper proposes a new tensor factorization based KGE model (TriVec). TriVec uses three parts for embeddings of entities and relations. The formulation of the score function enables the model to model symmetric and asymmetric relational patterns. Experimental results on the standard benchmark as well as real-world datasets show that TriVec outperforms the existing model.
Reasons to accept:
The analysis of the score function of ComplEx (Table 1) is interesting. The score function of ComplEx has four terms: two symmetric parts and two asymmetric parts. By removing different parts, the results do not change significantly. It shows that the score function of ComplEx has redundant parts.
Reasons to reject:
ComplEx (and its variants such as ComplEx-v3) has the ability of modeling symmetric and asymmetric relation patterns with only storing two vectors for each entity/relation. TriVec has the same capability while it uses one additional parameter (three parts).
In Multi-class loss configuration (Table 4), FB15K, ComplEx-N3-R obtains 0.79 (MRR) and 0.88 (Hits@10). The results are different from what are reported in [5] because of using a smaller embedding dimension (200). However, in [https://github.com/facebookresearch/kbc], the results with embedding dimension 100 are 83 (MRR) and 89 (Hits@10). Are the differences related to the hyper-parameter search?
According to Table 5, each entity and relation uses three vectors with the dimension of K. Therefore, TriVec uses 3K parameters for each entity/relation. Using K=200, 600 parameters are used per entity/relation. Does ComplEx-N3-R use the same number of parameters in Table 3?
Are the results of other models in Table 3. obtained with the same hyper-parameters search?
It would be interesting to compare TriVec with RotatE [Sun, Zhiqing, et al. "Rotate: Knowledge graph embedding by relational rotation in complex space." arXiv preprint arXiv:1902.10197 (2019)] and QuatE [Zhang, Shuai, et al. "Quaternion knowledge graph embeddings." Advances in Neural Information Processing Systems. 2019]
It would be helpful to include the results of ComplEx-V3-N3-R in Table 4.
Nanopublication comments:
Further comments:
The writing needs to be revised.
In Equation 10, \Phi^{TriVec}?
Captions of Figure 3 and 4 are same.
2 Comments
Note from the editor-in-chief
Submitted by Tobias Kuhn on
First of all, we apologize for the delay with this. The two reviewers raise a number of important points that need to be resolved before this manuscript can be accepted. The authors also should look at the section about "Extended Versions" of the Guidelines for Authors (https://datasciencehub.net/content/guidelines-authors) and make sure these conditions are fulfilled.
Tobias Kuhn (http://orcid.org/0000-0002-1267-0234)
No Revised Version Submitted: Marked as Rejected
Submitted by Tobias Kuhn on
As the authors did not submit a revised version, I will mark this submission as rejected.