Att-KGCN: Tourist Attractions Recommendation System by using Attention mechanism and Knowledge Graph Convolution Network

• URL: http://arxiv.org/abs/2306.10946v4
• Date: Mon, 3 Jul 2023 15:19:08 GMT
• Title: Att-KGCN: Tourist Attractions Recommendation System by using Attention mechanism and Knowledge Graph Convolution Network
• Authors: Ahmad A. Mubarak and JingJing Li and Han Cao
• Abstract summary: We propose the improved Attention Knowledge Graph Convolution Network model, named ($Att-KGCN$) The attention layer aggregates relatively similar locations and represents them with an adjacent vector. According to the tourist's preferred choices, the model predicts the probability of similar spots as a recommendation system.
• Score: 6.571146539235987
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The recommendation algorithm based on knowledge graphs is at a relatively mature stage. However, there are still some problems in the recommendation of specific areas. For example, in the tourism field, selecting suitable tourist attraction attributes process is complicated as the recommendation basis for tourist attractions. In this paper, we propose the improved Attention Knowledge Graph Convolution Network model, named ($Att-KGCN$), which automatically discovers the neighboring entities of the target scenic spot semantically. The attention layer aggregates relatively similar locations and represents them with an adjacent vector. Then, according to the tourist's preferred choices, the model predicts the probability of similar spots as a recommendation system. A knowledge graph dataset of tourist attractions used based on tourism data on Socotra Island-Yemen. Through experiments, it is verified that the Attention Knowledge Graph Convolution Network has a good effect on the recommendation of tourist attractions and can make more recommendations for tourists' choices.

Related papers

• Intrinsically motivated graph exploration using network theories of human curiosity [71.2717061477241]
  We propose a novel approach for exploring graph-structured data motivated by two theories of human curiosity. We use these proposed features as rewards for graph neural-network-based reinforcement learning.
  arXiv  Detail & Related papers  (2023-07-11T01:52:08Z)
• Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
  Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce. We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation. In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
  arXiv  Detail & Related papers  (2022-10-22T17:29:34Z)
• Shape Preserving Facial Landmarks with Graph Attention Networks [3.996275177789895]
  We propose a model based on the combination of a CNN with a cascade of Graph Attention Network regressors. We introduce an encoding that jointly represents the appearance and location of facial landmarks and an attention mechanism to weigh the information according to its reliability. Experiments confirm that the proposed model learns a global representation of the structure of the face, achieving top performance in popular benchmarks on head pose and landmark estimation.
  arXiv  Detail & Related papers  (2022-10-13T17:58:02Z)
• Conditional Attention Networks for Distilling Knowledge Graphs in Recommendation [74.14009444678031]
  We propose Knowledge-aware Conditional Attention Networks (KCAN) to incorporate knowledge graph into a recommender system. We use a knowledge-aware attention propagation manner to obtain the node representation first, which captures the global semantic similarity on the user-item network and the knowledge graph. Then, by applying a conditional attention aggregation on the subgraph, we refine the knowledge graph to obtain target-specific node representations.
  arXiv  Detail & Related papers  (2021-11-03T09:40:43Z)
• Recommending POIs for Tourists by User Behavior Modeling and Pseudo-Rating [3.839157829013354]
  Most tourist visit a few sightseeing spots once and most of these spots have no check-in data from new tourists. Most conventional systems rank sightseeing spots based on their popularity, reputations, and category-based similarities with users' preferences. We propose a mechanism to recommend POIs to tourists.
  arXiv  Detail & Related papers  (2021-10-13T06:21:41Z)
• DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN [59.160401038969795]
  We propose differentiable sampling on Knowledge Graph for Recommendation with GNN (DSKReG) We devise a differentiable sampling strategy, which enables the selection of relevant items to be jointly optimized with the model training procedure. The experimental results demonstrate that our model outperforms state-of-the-art KG-based recommender systems.
  arXiv  Detail & Related papers  (2021-08-26T16:19:59Z)
• Graphing else matters: exploiting aspect opinions and ratings in explainable graph-based recommendations [66.83527496838937]
  We propose to exploit embeddings extracted from graphs that combine information from ratings and aspect-based opinions expressed in textual reviews. We then adapt and evaluate state-of-the-art graph embedding techniques over graphs generated from Amazon and Yelp reviews on six domains. Our approach has the advantage of providing explanations which leverage aspect-based opinions given by users about recommended items.
  arXiv  Detail & Related papers  (2021-07-07T13:57:28Z)
• Knowledge-Enhanced Top-K Recommendation in Poincar\'e Ball [33.90069123451581]
  We propose a recommendation model in the hyperbolic space, which facilitates the learning of the hierarchical structure of knowledge graphs. A hyperbolic attention network is employed to determine the relative importances of neighboring entities of a certain item. We show that the proposed model outperforms the best existing models by 2-16% in terms of NDCG@K on Top-K recommendation.
  arXiv  Detail & Related papers  (2021-01-13T03:16:50Z)
• Self-supervised Graph Learning for Recommendation [69.98671289138694]
  We explore self-supervised learning on user-item graph for recommendation. An auxiliary self-supervised task reinforces node representation learning via self-discrimination. Empirical studies on three benchmark datasets demonstrate the effectiveness of SGL.
  arXiv  Detail & Related papers  (2020-10-21T06:35:26Z)
• Deep Learning on Knowledge Graph for Recommender System: A Survey [36.41255991011155]
  A knowledge graph is capable of encoding high-order relations that connect two objects with one or multiple related attributes. With the help of the emerging Graph Neural Networks (GNN), it is possible to extract both object characteristics and relations from KG.
  arXiv  Detail & Related papers  (2020-03-25T22:53:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.