4 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.LG2021★ 4 cited
Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding
Shimin Di, Quanming Yao, Yongqi Zhang +1
The scoring function, which measures the plausibility of triplets in knowledge graphs (KGs), is the key to ensure the excellent performance of KG embedding, and its design is also…
cs.LG2021★ 3 cited
Searching to Sparsify Tensor Decomposition for N-ary Relational Data
Shimin Di, Quanming Yao, Lei Chen
Tensor, an extension of the vector and matrix to the multi-dimensional case, is a natural way to describe the N-ary relational data. Recently, tensor decomposition methods have bee…