Aug. 16, 2022, 1:12 a.m. | Tao He, Ming Liu, Yixin Cao, Tianwen Jiang, Zihao Zheng, Jingrun Zhang, Sendong Zhao, Bing Qin

cs.CL updates on arXiv.org arxiv.org

Knowledge Graph Completion (KGC) aims to reason over known facts and infer
missing links but achieves weak performances on those sparse Knowledge Graphs
(KGs). Recent works introduce text information as auxiliary features or apply
graph densification to alleviate this challenge, but suffer from problems of
ineffectively incorporating structure features and injecting noisy triples. In
this paper, we solve the sparse KGC from these two motivations simultaneously
and handle their respective drawbacks further, and propose a plug-and-play
unified framework VEM$^2$L over …

arxiv framework graph knowledge knowledge graph text

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Social Insights & Data Analyst (Freelance)

@ Media.Monks | Jakarta

Cloud Data Engineer

@ Arkatechture | Portland, ME, USA