# Tag Info

2

I found the answer further into the paper! I'll post it here for everyone. Given any user, there is no pre-known targeted item in the KGRE-Rec (Knowledge Graph Reasoning for Explainable Recommendation) problem, so it is unfeasible to consider binary rewards indicating whether the agent has reached a target or not. Instead, the agent is encouraged to ...

1

Before trying to explain this term in your context, let me briefly describe the term in other contexts. In computer networking, the term "hop" refers to a node (e.g. a router) that a packet goes through before reaching its destination from its source. In a multi-hop situation, you have several nodes involved in the process of sending the packet from the ...

1

Short answer There is not a single answer to your question because knowledge graphs (KGs) and knowledge bases (KBs) have been defined in multiple (often ambiguous) ways in the past. Some people say that KGs are different from KBs, while other people use the term KG as a synonym for KB or define it as a type of KB. Long answer Appendix A.3 "Knowledge ...

1

Based on the related Wikipedia, a knowledge base (KB) is: a technology used to store complex structured and unstructured information used by a computer system. The initial use of the term was in connection with expert systems which were the first knowledge-based systems. As there are different representation model for a KB, we can find different ...

1

$\text{rank}(f((r,e)|u))$ in $A_t(u)$ means to compute the value of scoring function $f$ for all pairs $(r,e)\in A_t$ which are conditioned by $u$, then sort them in a descending order. The rank of the $f((r,e)|u)$ in this order is equal to $\text{rank}(f((r,e)|u))$. Hence $\text{rank}(f((r,e)|u)) \leqslant \alpha$ means to select the $\alpha$ top most ...

1

To put this insert to context, we should take at least this much of text from the paper: One line of research focuses on making recommendations using knowledge graph embedding models, such as TransE  and node2vec . These approaches align the knowledge graph in a regularized vector space and uncover the similarity between entities by calculating ...

Only top voted, non community-wiki answers of a minimum length are eligible