Advanced Graph Neural Networks

External reference: https://openalex.org/T11273

  1. Algorithm enumerates maximal balanced quasi-cliques in signed graphs
    Discover maximal balanced quasi-clique enumeration for signed graphs. A novel NP-hard algorithm identifies cohesive subgraphs with positive and negative edges using branch-and-bound optimization.
  2. Graph correlations test independence between binary networks
    Framework for testing conditional and unconditional independence between binary graphs using community correlations and graph encoder embeddings.
  3. LPS-GNN scales graph learning to 100-billion-edge graphs
    LPS-GNN enables efficient graph neural network processing on 100 billion-edge graphs using single GPUs, achieving 13.8% improvements in user acquisition tasks through novel graph partitioning.
  4. ICL Characterization of Climate Foundation Models: When Can Transformers Learn Weather and Climate?
    Theoretical analysis explains why climate foundation models succeed at field prediction but fail at extreme event detection through in-context learning complexity.
  5. Survey maps graph roles in retrieval-augmented generation
    Survey of graph-based techniques in retrieval-augmented generation systems, examining their roles in database construction, algorithms, and reasoning with structured knowledge.
  6. Learnable communication graphs improve multi-agent coordination
    Study proposes learnable communication graphs for multi-agent systems, enabling dynamic information sharing that adapts to task demands and reduces computational resource consumption.
  7. GeoGraphNetworks provides validated spatial network data
    GeoGraphNetworks: 110 validated spatial networks spanning US and UK transportation and hydrological systems in analysis-ready JSON and XLSX formats with complete topological and geographic data.
  8. Human-centric Evaluation of Semantic Resources: A Systematic Mapping Study
    Systematic mapping of human-centric evaluation approaches for semantic resources like ontologies and knowledge graphs, synthesizing 15 years of research into a theoretical framework.
  9. CORE: Data Augmentation for Link Prediction via Information Bottleneck
    CORE applies Information Bottleneck principles to augment graph data for link prediction, simultaneously recovering missing edges and reducing noise to enhance model robustness.
  10. Prompt-driven KG-enhanced LLM reasoning improved KBQA accuracy
    Prompt-driven framework combining LLMs with knowledge graphs for reliable knowledge-based question answering through structured subgraph retrieval and stepwise reasoning validation.
  11. HMMC improved heterogeneous graph representation learning
    Self-supervised heterogeneous graph neural network framework using multi-scale meta-path contrastive learning for improved local-global structural modeling.
  12. Graph matching improved IVUS-OCT sequence registration
    Graph matching framework for cross-modality intravascular ultrasound and optical coherence tomography sequence registration with simultaneous temporal and rotational alignment.