Pith. sign in

REVIEW 2 cited by

CSGDN: Contrastive Signed Graph Diffusion Network for Predicting Crop Gene-phenotype Associations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.07511 v2 pith:GADOMMM4 submitted 2024-10-10 cs.LG

classification cs.LG
keywords csgdnassociationscontrastivediffusiongraphpredictionsignedcrop
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Positive and negative association prediction between gene and phenotype helps to illustrate the underlying mechanism of complex traits in organisms. The transcription and regulation activity of specific genes will be adjusted accordingly in different cell types, developmental stages, and physiological states. There are the following two problems in obtaining the positive/negative associations between gene and trait: 1) High-throughput DNA/RNA sequencing and phenotyping are expensive and time-consuming due to the need to process large sample sizes; 2) experiments introduce both random and systematic errors, and, meanwhile, calculations or predictions using software or models may produce noise. To address these two issues, we propose a Contrastive Signed Graph Diffusion Network, CSGDN, to learn robust node representations with fewer training samples to achieve higher link prediction accuracy. CSGDN employs a signed graph diffusion method to uncover the underlying regulatory associations between genes and phenotypes. Then, stochastic perturbation strategies are used to create two views for both original and diffusive graphs. Lastly, a multi-view contrastive learning paradigm loss is designed to unify the node presentations learned from the two views to resist interference and reduce noise. We conduct experiments to validate the performance of CSGDN on three crop datasets: Gossypium hirsutum, Brassica napus, and Triticum turgidum. The results demonstrate that the proposed model outperforms state-of-the-art methods by up to 9.28% AUC for link sign prediction in G. hirsutum dataset.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Robust Deep Signed Graph Clustering via Weak Balance Theory

    cs.SI 2025-02 conditional novelty 6.0 of 10

    DSGC improves K-way signed graph clustering by denoising edge signs, augmenting graph structure, and training a weak-balance encoder that separates negatively linked nodes.

  2. Trustworthy GNNs with LLMs: A Systematic Review and Taxonomy

    cs.LG 2025-02 conditional novelty 4.0 of 10

    A review that groups LLM-GNN trustworthiness research under four dimensions, reliability, robustness, privacy, and reasoning, with no new experiments.

Pith tools