arXiv AI
QORH: Learning Query-Specific Ordered Rule Hypergraphs for Inductive Knowledge Graph Link Prediction
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Sep 10
Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods
arXiv:2506.05626v3 Announce Type: replace Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
arXiv AI
Aug 25
SLogic: Subgraph-Informed Logical Rule Learning for Knowledge Graph Completion
SLogic introduces a subgraph-informed approach to logical rule learning for knowledge graph completion, assigning query-dependent scores to rules instead of a single global weight. The framework uses a context-aware scoring function that evaluates the importance of a rule based on the local subgraph around the query’s head entity, aligning with the specificity principle of commonsense reasoning. Experiments on benchmark datasets demonstrate that SLogic performs competitively with other rule-based methods while producing human-readable, query-specific explanations.
arXiv Machine Learning
Jun 5
Q-GNN: Query-Conditioned Graph Neural Networks with Type Awareness for Knowledge Graph Completion
arXiv:2606. 05639v1 Announce Type: new Abstract: Knowledge Graph Completion (KGC) aims at predicting missing triplets from incomplete knowledge graphs, which is crucial for downstream applications.
arXiv AI
Oct 15
Co-adaptive Rule Routing and Constraining for Structured Knowledge Retrieval
arXiv:2610.14465v1 Announce Type: cross Abstract: Structured knowledge retrieval acquires task-relevant evidence from structured knowledge sources for downstream tasks. Existing methods rely on uncon...
arXiv Machine Learning
Aug 28
SLM-Conditioned Hierarchical Relation Routing for Labeled Property Graph Learning
The paper introduces SLM-Conditioned Hierarchical Relation Routing, a graph neural network architecture that incorporates a small language model to guide message selection in labeled property graphs. It combines structural states, node and relationship property encodings, and relationship types into messages, then uses a parameter‑efficient language model to generate target‑conditioned routing queries that filter relevant messages and route information across relation‑level summaries. The resulting representation updates a topology anchor with bounded residuals, preserving structural evidence while allowing contextual semantic information to influence predictions, and offers interpretable analysis at both neighbor and relationship‑type levels.
arXiv AI
Jun 30
Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs
arXiv:2606. 29860v1 Announce Type: new Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications.