Estimation of a causal directed acyclic graph process using non-gaussianity - Equipe Multimédia
Article Dans Une Revue Digital Signal Processing Année : 2024

Estimation of a causal directed acyclic graph process using non-gaussianity

Résumé

In machine learning and data mining, causal relationship discovery is a critical task. While the state-of-the-art Vector Auto-Regressive Linear Non-Gaussian Acyclic Model (VAR-LiNGAM) method excels in uncovering both instantaneous and time-lagged connections, it entails analyzing multiple VAR matrices, leading to heightened parameter complexity. To address this challenge, we introduce the Causal Graph Process-LiNGAM (CGP-LiNGAM), a novel approach that significantly reduces parameter load by focusing on a single causal graph, a Directed Acyclic Graph (DAG). Leveraging Graph Signal Processing (GSP) techniques, our method interprets causal relations with graph shift invariance and uniqueness. Our experimental results demonstrate the superiority and robustness of CGP-LiNGAM, particularly in high-noise environments. Moreover, we showcase its real-world applicability in studying brain connectivity during sleep, underlining its compatibility with previous sleep-related neuroscientific research.
Fichier principal
Vignette du fichier
Estimation_of_a_Causal_Directed_Acyclic_Graph_Process_using_Non_Gaussianity (1).pdf (817.24 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04541701 , version 1 (11-04-2024)

Licence

Identifiants

Citer

Aref Einizade, Jhony H. Giraldo, Fragkiskos D. Malliaros, Sepideh Hajipour Sardouie. Estimation of a causal directed acyclic graph process using non-gaussianity. Digital Signal Processing, 2024, 146, pp.104400. ⟨10.1016/j.dsp.2024.104400⟩. ⟨hal-04541701⟩
93 Consultations
56 Téléchargements

Altmetric

Partager

More