Unveiling Optimal SDG Pathways: An Innovative Approach Leveraging Graph Pruning and Intent Graph for Effective Recommendations

• URL: http://arxiv.org/abs/2309.11741v1
• Date: Thu, 21 Sep 2023 02:32:17 GMT
• Title: Unveiling Optimal SDG Pathways: An Innovative Approach Leveraging Graph Pruning and Intent Graph for Effective Recommendations
• Authors: Zhihang Yu, Shu Wang, Yunqiang Zhu, Wen Yuan, Xiaoliang Dai, Zhiqiang Zou
• Abstract summary: This paper proposes a method called User Graph after Pruning and Intent Graph (UGPIG) Firstly, we utilize the high-density linking capability of the pruned User Graph to address the issue of spatial neglect in recommendation algorithms. Secondly, we construct an Intent Graph by incorporating the intent network, which captures the preferences for attributes including environmental elements of target regions.
• Score: 12.444301825257071
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The recommendation of appropriate development pathways, also known as ecological civilization patterns for achieving Sustainable Development Goals (namely, sustainable development patterns), are of utmost importance for promoting ecological, economic, social, and resource sustainability in a specific region. To achieve this, the recommendation process must carefully consider the region's natural, environmental, resource, and economic characteristics. However, current recommendation algorithms in the field of computer science fall short in adequately addressing the spatial heterogeneity related to environment and sparsity of regional historical interaction data, which limits their effectiveness in recommending sustainable development patterns. To overcome these challenges, this paper proposes a method called User Graph after Pruning and Intent Graph (UGPIG). Firstly, we utilize the high-density linking capability of the pruned User Graph to address the issue of spatial heterogeneity neglect in recommendation algorithms. Secondly, we construct an Intent Graph by incorporating the intent network, which captures the preferences for attributes including environmental elements of target regions. This approach effectively alleviates the problem of sparse historical interaction data in the region. Through extensive experiments, we demonstrate that UGPIG outperforms state-of-the-art recommendation algorithms like KGCN, KGAT, and KGIN in sustainable development pattern recommendations, with a maximum improvement of 9.61% in Top-3 recommendation performance.

Related papers

• Geometric Feature Enhanced Knowledge Graph Embedding and Spatial Reasoning [8.561588656662419]
  Geospatial Knowledge Graphs (GeoKGs) model geoentities and spatial relationships in an interconnected manner. Existing methods for mining and reasoning from GeoKGs, such as popular knowledge graph embedding (KGE) techniques, lack geographic awareness. This study aims to enhance general-purpose KGE by developing new strategies and integrating geometric features of spatial relations.
  arXiv  Detail & Related papers  (2024-10-24T00:53:48Z)
• Combining Observational Data and Language for Species Range Estimation [63.65684199946094]
  We propose a novel approach combining millions of citizen science species observations with textual descriptions from Wikipedia. Our framework maps locations, species, and text descriptions into a common space, enabling zero-shot range estimation from textual descriptions. Our approach also acts as a strong prior when combined with observational data, resulting in more accurate range estimation with less data.
  arXiv  Detail & Related papers  (2024-10-14T17:22:55Z)
• Eco-Aware Graph Neural Networks for Sustainable Recommendations [5.829910985081357]
  Graph Neural Networks (GNNs) have emerged as a promising approach for recommender systems. In this study, we investigate the environmental impact of GNN-based recommender systems.
  arXiv  Detail & Related papers  (2024-10-12T12:26:04Z)
• Enhancing Ecological Monitoring with Multi-Objective Optimization: A Novel Dataset and Methodology for Segmentation Algorithms [17.802456388479616]
  We introduce a unique semantic segmentation dataset of 6,096 high-resolution aerial images capturing indigenous and invasive grass species in Bega Valley, New South Wales, Australia. This dataset presents a challenging task due to the overlap and distribution of grass species. The dataset and code will be made publicly available, aiming to drive research in computer vision, machine learning, and ecological studies.
  arXiv  Detail & Related papers  (2024-07-25T18:27:27Z)
• IENE: Identifying and Extrapolating the Node Environment for Out-of-Distribution Generalization on Graphs [10.087216264788097]
  We propose IENE, an OOD generalization method on graphs based on node-level environmental identification and extrapolation techniques. It strengthens the model's ability to extract invariance from two granularities simultaneously, leading to improved generalization.
  arXiv  Detail & Related papers  (2024-06-02T14:43:56Z)
• Memory efficient location recommendation through proximity-aware representation [8.505840656442217]
  We introduce a Proximity-aware based region representation for Sequential Recommendation (PASR) We tackle the sparsity issue through a novel loss function employing importance sampling, which emphasizes informative negative samples during optimization. We conducted evaluations using three real-world Location-Based Social Networking (LBSN) datasets, demonstrating that PASR surpasses state-of-the-art sequential location recommendation methods.
  arXiv  Detail & Related papers  (2023-10-10T09:53:07Z)
• Graph Neural Bandits [49.85090929163639]
  We propose a framework named Graph Neural Bandits (GNB) to leverage the collaborative nature among users empowered by graph neural networks (GNNs) To refine the recommendation strategy, we utilize separate GNN-based models on estimated user graphs for exploitation and adaptive exploration.
  arXiv  Detail & Related papers  (2023-08-21T15:57:57Z)
• 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)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• An Adaptive Graph Pre-training Framework for Localized Collaborative Filtering [79.17319280791237]
  We propose an adaptive graph pre-training framework for localized collaborative filtering (ADAPT) ADAPT captures both the common knowledge across different graphs and the uniqueness for each graph. It does not require transferring user/item embeddings, and is able to capture both the common knowledge across different graphs and the uniqueness for each graph.
  arXiv  Detail & Related papers  (2021-12-14T06:53:13Z)
• Graph Learning based Recommender Systems: A Review [111.43249652335555]
  Graph Learning based Recommender Systems (GLRS) employ advanced graph learning approaches to model users' preferences and intentions as well as items' characteristics for recommendations. We provide a systematic review of GLRS, by discussing how they extract important knowledge from graph-based representations to improve the accuracy, reliability and explainability of the recommendations.
  arXiv  Detail & Related papers  (2021-05-13T14:50:45Z)

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.