← Home

Daily arXiv Papers

Graph Neural Networks · Graph Learning · LLM × Graph
Conferences
Archives
2026-08-11 2026-08-10 2026-08-09 2026-08-08 2026-08-07 2026-08-06 2026-08-05 2026-08-04 2026-08-03 2026-08-02 2026-08-01 2026-07-31 2026-07-30 2026-07-29 2026-07-28 2026-07-27 2026-07-26 2026-07-25 2026-07-24 2026-07-23 2026-07-22 2026-07-21 2026-07-20 2026-07-19 2026-07-18 2026-07-17 2026-07-16 2026-07-15 2026-07-14 2026-07-13 2026-07-12 2026-07-11 2026-07-10 2026-07-09 2026-07-08 2026-07-07 2026-07-06 2026-07-05 2026-07-04 2026-07-03 2026-07-02 2026-07-01 2026-06-30 2026-06-29 2026-06-28 2026-06-27 2026-06-26 2026-06-25 2026-06-24 2026-06-23 2026-06-22 2026-06-21 2026-06-20 2026-06-19 2026-06-18 2026-06-17 2026-06-16 2026-06-15 2026-06-14 2026-06-13 2026-06-12 2026-06-11 2026-06-10 2026-06-09 2026-06-08 2026-06-07 2026-06-06 2026-06-05 2026-06-04 2026-06-03 2026-06-02 2026-06-01 2026-05-31 2026-05-30 2026-05-29 2026-05-28 2026-05-27 2026-05-26 2026-05-25 2026-05-24 2026-05-23 2026-05-22 2026-05-21 2026-05-20 2026-05-19 2026-05-18 2026-05-17 2026-05-16 2026-05-15 2026-05-14 2026-05-13 2026-05-12 2026-05-11 2026-05-10 2026-05-09 2026-05-08 2026-05-07 2026-05-06 2026-05-05 2026-05-04 2026-05-03 2026-05-02 2026-05-01 2026-04-30 2026-04-29 2026-04-28 2026-04-27 2026-04-26 2026-04-25 2026-04-24 2026-04-23 2026-04-22 2026-04-21 2026-04-20 2026-04-19 2026-04-18 2026-04-17 2026-04-16 2026-04-15 2026-04-14 2026-04-13 2026-04-12 2026-04-11 2026-04-10 2026-04-09 2026-04-08 2026-04-07 2026-04-06 2026-04-05 2026-04-04 2026-04-03 2026-04-02 2026-04-01 2026-03-31 2026-03-30 2026-03-29 2026-03-28 2026-03-27 2026-03-26 2026-03-25 2026-03-24 2026-03-23 2026-03-22 2026-03-21 2026-03-20 2026-03-19 2026-03-18 2026-03-17 2026-03-16 2026-03-15 2026-03-14 2026-03-13 2026-03-12 2026-03-11 2026-03-10 2026-03-09 2026-03-07 2026-03-06 2026-03-05 2026-03-04 2026-03-03 2026-03-02 2026-03-01 2026-02-28 2026-02-27 2026-02-26 2026-02-25 2026-02-24 2026-02-23 2026-02-22 2026-02-21 2026-02-20 2026-02-19 2026-02-18 2026-02-17 2026-02-16 2026-02-15 2026-02-14 2026-02-13 2026-02-12

Showing 9 papers for 2026-07-11

A Graph Neural Network Model for Real-Time Gesture Recognition Based on sEMG Signals
GNN Graph Learning

This paper proposes representing surface EMG signals as muscle-activation graphs and training a graph neural network for real-time hand gesture recognition. By encoding forearm muscle activity as graphs, the method captures spatial-temporal activation patterns that improve discrimination among gestures. Experiments demonstrate real-time capability suitable for controlling advanced prostheses and augmented reality interfaces.

PolyUQuest: Verifiable Structure-Aware Web RAG over Heterogeneous Graphs
Graph Learning

PolyUQuest introduces a verifiable, structure-aware web retrieval-augmented generation framework built on a heterogeneous graph that integrates hyperlink topology, page DOM structure, and cross-page entity relations. A two-tier router dispatches each query to one of three retrieval modes—direct block retrieval, cross-page graph traversal, and multi-hop entity retrieval—to match structural needs and provide verifiable, context-rich answers. It also ensures verifiability and provenance for generated content.

Graph-Regularized Deep Learning for EEG-Based Emotion Recognition with Psychologically-Grounded Label Structure
Graph Learning

This work tackles EEG-based emotion recognition by introducing a graph-regularized learning framework where emotions are nodes in a graph connected by proximities from dimensional theories. Three complementary regularization strategies, including Graph Label Smoothing and commuting-distance penalties on the graph, enforce psychological relationships and improve robustness to label noise.

path_boost: A Python Package for Interpretable Graph-Level Prediction using Path-Based Gradient Boosting
Graph Learning

path_boost is a Python package that implements PathBoost, a gradient-boosting method for interpretable graph-level prediction based on labeled path features. During training it automatically discovers predictive paths, yielding an additive model where each path contributes transparently to the prediction, and it avoids exhaustively enumerating all possible paths.

Dimensionality Reduction Meets Network Science: Sensemaking on UMAP's kNN Graph
Graph Theory

This paper explores the internal kNN graph constructed by UMAP and shows that it encodes valuable manifold structure prior to projection. Applying standard graph algorithms (e.g., PageRank) on this graph enhances sensemaking by identifying representative points and revealing connectivity patterns.

MetaHGNIE: Meta-Path Induced Hypergraph Contrastive Learning in Heterogeneous Knowledge Graphs
Knowledge Graph Graph Learning

MetaHGNIE introduces meta-path induced hypergraph contrastive learning for heterogeneous knowledge graphs to capture higher-order interactions beyond pairwise messages. By disentangling topology and semantic attributes and leveraging meta-relational structures, it yields more discriminative node importance representations for tasks like recommendation and search.

Knowledge Graph and Accurate Portrait Construction of Scientific and Technological Academic Conferences
Knowledge Graph

This work uses knowledge graphs to construct accurate portraits of scientific and technological academic conferences, organizing entities such as papers, researchers, institutions, projects, and topics. It aims to improve efficient information discovery and decision making by modeling conference ecosystems and their relationships.

Bridging Cognitive Neuroscience and Graph Intelligence: Hippocampus-Inspired Multi-View Hypergraph Learning for Web Finance Fraud
Graph Learning

This paper proposes hippocampus-inspired multi-view hypergraph learning for web finance fraud detection, bridging cognitive neuroscience and graph intelligence. It addresses long-tailed data distributions and rare fraudulent patterns by fusing signals across multiple views through hypergraphs, enhancing detection performance.

KG-SoftMAP: Soft Knowledge-Graph Priors for Bayesian Network Structure Learning from Sparse Discrete Data
Knowledge Graph Graph Learning

KG-SoftMAP encodes domain knowledge as soft, weighted edge priors on a Bayesian network and optimizes a MAP objective by combining this prior with the BDeu score. In sparse discrete data settings, data-only methods struggle to recover structure, and the KG-SoftMAP approach improves BN structure learning by leveraging informative priors.