20 results for “Graph Processing for Machine Learning (GPML)”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Majed Jaber, Abdul Qadir Khan, Ankush Meshram, Julien Michel +2 more
This paper proposes a topology-driven approach for detecting cyberattacks in water distribution networks using Graph Processing for Machine Learning (GPML) and community/spectral graph metrics.
Sjoerd Vink, Suyang Li, Brian Montambault, Michael Behrisch +2 more
This paper introduces ZipLine, a system for integrative analysis of multivariate graphs through a unified predicate language and learning algorithm.
The paper introduces GraphARC, a new benchmark for abstract reasoning on graph-structured data, demonstrating that current state-of-the-art language models struggle with full graph transformation task…
Peng Fang, Arijit Khan, Ziqiang Wu, Zhenli Li +3 more
This paper presents FeLoG, a feedback loop-driven system for scalable distributed graph embedding that improves efficiency and speed.
This paper investigates the use of spectral filtering for continuous subgraph matching over dynamic graphs and presents three key findings.
Haoxiang Cheng, Yunfei Wang, Chao Chen, Kewei Cheng +4 more
The paper proposes GRiD, a novel framework that uses a two-phase training strategy (supervised pre-training and RL fine-tuning) to discover complex, graph-like rules for knowledge graph reasoning, ove…
The paper introduces FrontGI, a set of techniques for fast and scalable GNN inference on large-scale graphs.
Zerui Chen, Qinggang Zhang, Zhishang Xiang, Zhimin Wei +4 more
LegalGraphRAG introduces a multi-agent, hierarchical graph retrieval-augmented generation framework to overcome the limitations of traditional RAG in legal domains, achieving state-of-the-art reliable…
The paper proposes a solution to the lack of compositionality in graph query languages GQL and SQL/PGQ.
An approach is described to support rigid α canonical variables in an e-graph.
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
This paper introduces GraphBU, a graph-native MILP instance generator whose unit is a local subproblem plus its interface, promoting coupling and preserving feasibility.
This paper models the changes in graph adjacency matrices over time as a low-rank matrix and develops a method for jointly interpolating signals and estimating graph adjacency matrices using this assu…
Taurus is a single-machine system for efficient Graph Neural Network (GNN) inference on large-scale graphs that do not fit in RAM, using source-centric broadcasts and a pipelined GPU-CPU-SSD hierarchy…
The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.