Search Results for author:
Found 5 papers, 3 papers with code
Learning Explicit User Interest Boundary for Recommendation
The core objective of modelling recommender systems from implicit feedback is to maximize the positive sample score $s_p$ and minimize the negative sample score $s_n$, which can usually be summarized into two paradigms: the pointwise and the pairwise.
Is There More Pattern in Knowledge Graph? Exploring Proximity Pattern for Knowledge Graph Embedding
Modeling of relation pattern is the core focus of previous Knowledge Graph Embedding works, which represents how one entity is related to another semantically by some explicit relation.
How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View
However, most existing KGE works focus on the design of delicate triple modeling function, which mainly tells us how to measure the plausibility of observed triples, but offers limited explanation of why the methods can extrapolate to unseen data, and what are the important factors to help KGE extrapolate.
Ranked #9 on
Link Prediction
on FB15k-237
A Relation-Specific Attention Network for Joint Entity and Relation Extraction
Joint extraction of entities and relations is an important task in natural language processing (NLP), which aims to capture all relational triplets from plain texts.
Ranked #11 on
Relation Extraction
on WebNLG
Dan: Deep attention neural network for news recommendation
With the rapid information explosion of news, making personalized news recommendation for users becomes an increasingly challenging problem.
