Swift and Sure: Hardness-aware Contrastive Learning for Low-dimensional Knowledge Graph Embeddings

3 January 2022

Papers citing "Swift and Sure: Hardness-aware Contrastive Learning for Low-dimensional Knowledge Graph Embeddings"

6 / 6 papers shown

Title
Knowledge Graph Self-Supervised Rationalization for Recommendation Yuhao Yang Chao Huang Lianghao Xia Chunzhen Huang 27 88 0 06 Jul 2023
HaSa: Hardness and Structure-Aware Contrastive Knowledge Graph Embedding Honggen Zhang June Zhang Igor Molybog 26 4 0 17 May 2023
From Wide to Deep: Dimension Lifting Network for Parameter-efficient Knowledge Graph Embedding Borui Cai Yong Xiang Longxiang Gao Di Wu Heng Zhang Jiongdao Jin Tom H. Luan 26 1 0 22 Mar 2023
Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods? Anson Bastos Kuldeep Singh Abhishek Nadgeri Johannes Hoffart Toyotaro Suzumura Manish Singh 22 3 0 30 Jan 2023
Learning Intents behind Interactions with Knowledge Graph for Recommendation Xiang Wang Tinglin Huang Dingxian Wang Yancheng Yuan Zhenguang Liu Xiangnan He Tat-Seng Chua 88 414 0 14 Feb 2021
Efficient Estimation of Word Representations in Vector Space Tomáš Mikolov Kai Chen G. Corrado J. Dean 3DV 245 31,257 0 16 Jan 2013