SEAGAN: domain-Specific and Edge-Aware Graph Attention Network for Dynamic Plant Processes

• URL: http://arxiv.org/abs/2606.19623v2
• Date: Tue, 23 Jun 2026 04:43:25 GMT
• Title: SEAGAN: domain-Specific and Edge-Aware Graph Attention Network for Dynamic Plant Processes
• Abstract summary: A key example is the A-Ci curve, which relates the net CO2 assimilation rate (Anet) to leaf intercellular CO2 concentration (Ci)<n> accurate estimation requires accurate identification of the active biochemical limiting state at each curve point.<n>Here, we express the limitation-state identification in A-Ci curves as a graph-based node classification problem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph neural networks (GNNs) offer a flexible framework for learning from scientific data with physical, biological, or functional associations. One promising domain is plant physiology, where observed responses result from several interacting processes that are difficult to isolate, even with human intervention. A key example is the A-Ci curve, which relates the net CO2 assimilation rate (Anet) to leaf intercellular CO2 concentration (Ci) and is also used to estimate photosynthetic parameters in biophysical models. However, accurate estimation requires accurate identification of the active biochemical limiting state at each curve point, which is a major source of uncertainty. Here, we express the limitation-state identification in A-Ci curves as a graph-based node classification problem. A graph representation of the A-Ci curve is created using distance-based k-nearest-neighbor (kNN) and auxiliary-signal-guided (ASG) connectivity. The methodology was evaluated against the conventional machine learning baselines, graph-based architectures, and an automated fitting-based benchmark. Results on a large synthetic dataset with known ground-truth limitation states show that graph-based models improve classification, especially near biochemical transition areas. The top-performing configuration, SEAGAN (domain-Specific and Edge-Aware Graph Attention Network for Dynamic Plant Processes), integrates process-aware node features, edge attributes, kNN connectivity, and graph attention with a weighted cross-entropy loss, obtaining an F1-score of 0.857 and accuracy of 0.882. The results suggest that using A-Ci curves as graphs enables better identification of the biochemical limiting condition and reduces the uncertainty associated with both human and automated methods.

Related papers

• engGNN: A Dual-Graph Neural Network for Omics-Based Disease Classification and Feature Selection [5.54797146496798]
  Graph Neural Networks (GNNs) offer a promising way to integrate prior knowledge by encoding feature relationships as graphs.<n>We propose the external and generated Graph Neural Network (engGNN), a dual-graph framework that jointly leverages both external known biological networks and data-driven generated graphs.<n>engGNN consistently outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-01-20T23:18:56Z)
• Geometric Multi-color Message Passing Graph Neural Networks for Blood-brain Barrier Permeability Prediction [1.488392495573075]
  This paper introduces the geometric multi-color message-passing graph neural network (GMC-MPNN)<n>Our model constructs weighted colored subgraphs based on atom types to capture the spatial relationships and chemical context that govern blood-brain barrier permeability.
  arXiv  Detail & Related papers  (2025-07-25T03:38:46Z)
• A Graph-Based Framework for Interpretable Whole Slide Image Analysis [86.37618055724441]
  We develop a framework that transforms whole-slide images into biologically-informed graph representations.<n>Our approach builds graph nodes from tissue regions that respect natural structures, not arbitrary grids.<n>We demonstrate strong performance on challenging cancer staging and survival prediction tasks.
  arXiv  Detail & Related papers  (2025-03-14T20:15:04Z)
• Soybean Disease Detection via Interpretable Hybrid CNN-GNN: Integrating MobileNetV2 and GraphSAGE with Cross-Modal Attention [1.927711700724334]
  Soybean leaf disease detection is critical for agricultural productivity but faces challenges due to visually similar symptoms and limited interpretability.<n>This paper proposes an interpretable hybrid Sequential CNN-Graph Neural Network (GNN) framework that synergizes MobileNetV2 for localized feature extraction and GraphSAGE for relational modeling.<n>Cross-modal interpretability is achieved via Grad-CAM and Eigen-CAM visualizations, generating heatmaps to highlight disease-influential regions.
  arXiv  Detail & Related papers  (2025-03-03T08:12:09Z)
• 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)
• Cell Graph Transformer for Nuclei Classification [78.47566396839628]
  We develop a cell graph transformer (CGT) that treats nodes and edges as input tokens to enable learnable adjacency and information exchange among all nodes. Poorly features can lead to noisy self-attention scores and inferior convergence. We propose a novel topology-aware pretraining method that leverages a graph convolutional network (GCN) to learn a feature extractor.
  arXiv  Detail & Related papers  (2024-02-20T12:01:30Z)
• Relation Embedding based Graph Neural Networks for Handling Heterogeneous Graph [58.99478502486377]
  We propose a simple yet efficient framework to make the homogeneous GNNs have adequate ability to handle heterogeneous graphs. Specifically, we propose Relation Embedding based Graph Neural Networks (RE-GNNs), which employ only one parameter per relation to embed the importance of edge type relations and self-loop connections.
  arXiv  Detail & Related papers  (2022-09-23T05:24:18Z)
• Discovering the Representation Bottleneck of Graph Neural Networks from Multi-order Interactions [51.597480162777074]
  Graph neural networks (GNNs) rely on the message passing paradigm to propagate node features and build interactions. Recent works point out that different graph learning tasks require different ranges of interactions between nodes. We study two common graph construction methods in scientific domains, i.e., emphK-nearest neighbor (KNN) graphs and emphfully-connected (FC) graphs.
  arXiv  Detail & Related papers  (2022-05-15T11:38:14Z)
• Spiking Graph Convolutional Networks [19.36064180392385]
  SpikingGCN is an end-to-end framework that aims to integrate the embedding of GCNs with the biofidelity characteristics of SNNs. We show that SpikingGCN on a neuromorphic chip can bring a clear advantage of energy efficiency into graph data analysis.
  arXiv  Detail & Related papers  (2022-05-05T16:44:36Z)
• Heterogeneous Graph Neural Networks using Self-supervised Reciprocally Contrastive Learning [102.9138736545956]
  Heterogeneous graph neural network (HGNN) is a very popular technique for the modeling and analysis of heterogeneous graphs. We develop for the first time a novel and robust heterogeneous graph contrastive learning approach, namely HGCL, which introduces two views on respective guidance of node attributes and graph topologies. In this new approach, we adopt distinct but most suitable attribute and topology fusion mechanisms in the two views, which are conducive to mining relevant information in attributes and topologies separately.
  arXiv  Detail & Related papers  (2022-04-30T12:57:02Z)
• Distance-aware Molecule Graph Attention Network for Drug-Target Binding Affinity Prediction [54.93890176891602]
  We propose a diStance-aware Molecule graph Attention Network (S-MAN) tailored to drug-target binding affinity prediction. As a dedicated solution, we first propose a position encoding mechanism to integrate the topological structure and spatial position information into the constructed pocket-ligand graph. We also propose a novel edge-node hierarchical attentive aggregation structure which has edge-level aggregation and node-level aggregation.
  arXiv  Detail & Related papers  (2020-12-17T17:44:01Z)
• EPGAT: Gene Essentiality Prediction With Graph Attention Networks [1.1602089225841632]
  We propose EPGAT, an approach for essentiality prediction based on Graph Attention Networks (GATs) Our model directly learns patterns of gene essentiality from PPI networks, integrating additional evidence from multiomics data encoded as node attributes. We benchmarked EPGAT for four organisms, including humans, accurately predicting gene essentiality with AUC score ranging from 0.78 to 0.97.
  arXiv  Detail & Related papers  (2020-07-19T13:47:15Z)
• Unifying Graph Convolutional Neural Networks and Label Propagation [73.82013612939507]
  We study the relationship between LPA and GCN in terms of two aspects: feature/label smoothing and feature/label influence. Based on our theoretical analysis, we propose an end-to-end model that unifies GCN and LPA for node classification. Our model can also be seen as learning attention weights based on node labels, which is more task-oriented than existing feature-based attention models.
  arXiv  Detail & Related papers  (2020-02-17T03:23:13Z)

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.