Including Node Textual Metadata in Laplacian-constrained Gaussian Graphical Models

• URL: http://arxiv.org/abs/2602.15920v1
• Date: Tue, 17 Feb 2026 09:43:47 GMT
• Title: Including Node Textual Metadata in Laplacian-constrained Gaussian Graphical Models
• Authors: Jianhua Wang, Killian Cressant, Pedro Braconnot Velloso, Arnaud Breloy,
• Abstract summary: We propose a graph learning approach based on Laplacian-constrained GGMs that jointly leverages the node signals and such metadata.<n> Experimental results on a real-world financial dataset demonstrate that the proposed method significantly improves graph clustering performance.
• Score: 10.329784136000344
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper addresses graph learning in Gaussian Graphical Models (GGMs). In this context, data matrices often come with auxiliary metadata (e.g., textual descriptions associated with each node) that is usually ignored in traditional graph estimation processes. To fill this gap, we propose a graph learning approach based on Laplacian-constrained GGMs that jointly leverages the node signals and such metadata. The resulting formulation yields an optimization problem, for which we develop an efficient majorization-minimization (MM) algorithm with closed-form updates at each iteration. Experimental results on a real-world financial dataset demonstrate that the proposed method significantly improves graph clustering performance compared to state-of-the-art approaches that use either signals or metadata alone, thus illustrating the interest of fusing both sources of information.

Related papers

• Semi-supervised Instruction Tuning for Large Language Models on Text-Attributed Graphs [62.544129365882014]
  We propose a novel Semi-supervised Instruction Tuning pipeline for Graph Learning, named SIT-Graph.<n> SIT-Graph is model-agnostic and can be seamlessly integrated into any graph instruction tuning method that utilizes LLMs as the predictor.<n>Extensive experiments demonstrate that when incorporated into state-of-the-art graph instruction tuning methods, SIT-Graph significantly enhances their performance on text-attributed graph benchmarks.
  arXiv  Detail & Related papers  (2026-01-19T08:10:53Z)
• Neighborhood-Adaptive Generalized Linear Graph Embedding with Latent Pattern Mining [0.0]
  Graph embedding has been widely applied in areas such as network analysis, social network mining, recommendation systems, and bioinformatics.<n>We propose a novel model, Neighborhood-Adaptive Generalized Linear Graph Embedding (NGLGE), grounded in latent pattern mining.<n>This model introduces an adaptive graph learning method tailored to the neighborhood, effectively revealing intrinsic data correlations.
  arXiv  Detail & Related papers  (2025-10-07T09:37:29Z)
• Leveraging Low-rank Factorizations of Conditional Correlation Matrices in Graph Learning [46.49143964254245]
  This paper addresses the problem of learning an undirected graph from data gathered at each nodes.<n>The corresponding graph learning problem then scales to the squares of the number of variables (nodes)<n>We propose a graph learning framework that leverages a low-rank factorization of the conditional correlation matrix.
  arXiv  Detail & Related papers  (2025-06-12T12:13:11Z)
• Heterogeneous Graph Structure Learning through the Lens of Data-generating Processes [11.774563966512709]
  Inferring the graph structure from observed data is a key task in graph machine learning.<n>This paper introduces the first approach for heterogeneous graph structure learning (HGSL)
  arXiv  Detail & Related papers  (2025-03-11T16:14:53Z)
• Joint Graph Learning and Model Fitting in Laplacian Regularized Stratified Models [5.933030735757292]
  Laplacian regularized stratified models (LRSM) are models that utilize the explicit or implicit network structure of the sub-problems. This paper shows the importance and sensitivity of graph weights in LRSM, and provably show that the sensitivity can be arbitrarily large. We propose a generic approach to jointly learn the graph while fitting the model parameters by solving a single optimization problem.
  arXiv  Detail & Related papers  (2023-05-04T06:06:29Z)
• Graph Condensation via Receptive Field Distribution Matching [61.71711656856704]
  This paper focuses on creating a small graph to represent the original graph, so that GNNs trained on the size-reduced graph can make accurate predictions. We view the original graph as a distribution of receptive fields and aim to synthesize a small graph whose receptive fields share a similar distribution.
  arXiv  Detail & Related papers  (2022-06-28T02:10:05Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• Evolving-Graph Gaussian Processes [20.065168755580558]
  Existing approaches have focused on static structures, whereas many real graph data represent a dynamic structure, limiting the applications of GGPs. We propose evolving-Graph Gaussian Processes (e-GGPs) to overcome this. We demonstrate the benefits of e-GGPs over static graph Gaussian Process approaches.
  arXiv  Detail & Related papers  (2021-06-29T07:16:04Z)
• A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
  We propose a robust framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution. Based on this framework, we propose three models to handle three types of graph data.
  arXiv  Detail & Related papers  (2021-05-22T07:05:48Z)
• Graph Pooling with Node Proximity for Hierarchical Representation Learning [80.62181998314547]
  We propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology. Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
  arXiv  Detail & Related papers  (2020-06-19T13:09:44Z)
• Wasserstein-based Graph Alignment [56.84964475441094]
  We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
  arXiv  Detail & Related papers  (2020-03-12T22:31:59Z)

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.