Macroeconomic forecasting with statistically validated knowledge graphs

• URL: http://arxiv.org/abs/2104.10457v1
• Date: Wed, 21 Apr 2021 10:57:35 GMT
• Title: Macroeconomic forecasting with statistically validated knowledge graphs
• Authors: Sonja Tilly, Giacomo Livan
• Abstract summary: This study leverages narrative from global newspapers to construct theme-based knowledge graphs about world events. We find that features extracted from such graphs improve forecasts of industrial production in three large economies compared to a number of benchmarks. Our work serves as a blueprint for the construction of parsimonious - yet informative - theme-based knowledge graphs to monitor in real time the evolution of relevant phenomena in socio-economic systems.
• Score: 11.4219428942199
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This study leverages narrative from global newspapers to construct theme-based knowledge graphs about world events, demonstrating that features extracted from such graphs improve forecasts of industrial production in three large economies compared to a number of benchmarks. Our analysis relies on a filtering methodology that extracts "backbones" of statistically significant edges from large graph data sets. We find that changes in the eigenvector centrality of nodes in such backbones capture shifts in relative importance between different themes significantly better than graph similarity measures. We supplement our results with an interpretability analysis, showing that the theme categories "disease" and "economic" have the strongest predictive power during the time period that we consider. Our work serves as a blueprint for the construction of parsimonious - yet informative - theme-based knowledge graphs to monitor in real time the evolution of relevant phenomena in socio-economic systems.

Related papers

• A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation [59.14165404728197]
  We provide an up-to-date and forward-looking review of deep graph learning under distribution shifts. Specifically, we cover three primary scenarios: graph OOD generalization, training-time graph OOD adaptation, and test-time graph OOD adaptation. To provide a better understanding of the literature, we systematically categorize the existing models based on our proposed taxonomy.
  arXiv  Detail & Related papers  (2024-10-25T02:39:56Z)
• Parametric Graph Representations in the Era of Foundation Models: A Survey and Position [69.48708136448694]
  Graphs have been widely used in the past decades of big data and AI to model comprehensive relational data. Identifying meaningful graph laws can significantly enhance the effectiveness of various applications.
  arXiv  Detail & Related papers  (2024-10-16T00:01:31Z)
• Disentangled Structural and Featural Representation for Task-Agnostic Graph Valuation [9.633110326799992]
  We introduce a novel framework called blind message passing, which aligns the seller's and buyer's graphs using a shared node permutation. We then consider featural aspects of buyers' and sellers' graphs for data valuation and capture their statistical similarities and differences. Our approach ensures that buyers and sellers remain unaware of each other's datasets.
  arXiv  Detail & Related papers  (2024-08-22T18:05:41Z)
• CEGRL-TKGR: A Causal Enhanced Graph Representation Learning Framework for Improving Temporal Knowledge Graph Extrapolation Reasoning [1.6795461001108096]
  We propose an innovative causal enhanced graph representation learning framework for temporal knowledge graph reasoning (TKGR) We first disentangle the evolutionary representations of entities and relations in a temporal graph sequence into two distinct components, namely causal representations and confounding representations.
  arXiv  Detail & Related papers  (2024-08-15T03:34:53Z)
• Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning [53.81365215811222]
  We provide a review and summary of the latest approaches, strategies, and insights that address distribution shifts within the context of graph learning. We categorize existing graph learning methods into several essential scenarios, including graph domain adaptation learning, graph out-of-distribution learning, and graph continual learning. We discuss the potential applications and future directions for graph learning under distribution shifts with a systematic analysis of the current state in this field.
  arXiv  Detail & Related papers  (2024-02-26T07:52:40Z)
• FairWire: Fair Graph Generation [18.6649050946022]
  This work focuses on the analysis and mitigation of structural bias for both real and synthetic graphs. To alleviate the identified bias factors, we design a novel fairness regularizer that offers a versatile use. We propose a fair graph generation framework, FairWire, by leveraging our fair regularizer design in a generative model.
  arXiv  Detail & Related papers  (2024-02-06T20:43:00Z)
• A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions [64.84521350148513]
  Graphs represent interconnected structures prevalent in a myriad of real-world scenarios. Effective graph analytics, such as graph learning methods, enables users to gain profound insights from graph data. However, these methods often suffer from data imbalance, a common issue in graph data where certain segments possess abundant data while others are scarce. This necessitates the emerging field of imbalanced learning on graphs, which aims to correct these data distribution skews for more accurate and representative learning outcomes.
  arXiv  Detail & Related papers  (2023-08-26T09:11:44Z)
• A Survey on Fairness for Machine Learning on Graphs [2.3326951882644553]
  This survey is the first one dedicated to fairness for relational data. It aims to present a comprehensive review of state-of-the-art techniques in fairness on graph mining.
  arXiv  Detail & Related papers  (2022-05-11T10:40:56Z)
• Catastrophic Forgetting in Deep Graph Networks: an Introductory Benchmark for Graph Classification [12.423303337249795]
  We study the phenomenon of catastrophic forgetting in the graph representation learning scenario. We find that replay is the most effective strategy in so far, which also benefits the most from the use of regularization.
  arXiv  Detail & Related papers  (2021-03-22T12:07:21Z)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)
• Deep Learning for Learning Graph Representations [58.649784596090385]
  Mining graph data has become a popular research topic in computer science. The huge amount of network data has posed great challenges for efficient analysis. This motivates the advent of graph representation which maps the graph into a low-dimension vector space.
  arXiv  Detail & Related papers  (2020-01-02T02:13:28Z)

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.