OntoKG: Ontology-Oriented Knowledge Graph Construction with Intrinsic-Relational Routing

• URL: http://arxiv.org/abs/2604.02618v1
• Date: Fri, 03 Apr 2026 01:17:51 GMT
• Title: OntoKG: Ontology-Oriented Knowledge Graph Construction with Intrinsic-Relational Routing
• Abstract summary: We present an ontology-oriented approach to organizing a large-scale knowledge graph into a typed property graph.<n>The core mechanism is intrinsic-relational routing, which classifies every property as either intrinsic or relational.<n>This routing produces a declarative schema that is portable across storage backends and independently reusable.
• Score: 0.3642823642133188
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Organizing a large-scale knowledge graph into a typed property graph requires structural decisions -- which entities become nodes, which properties become edges, and what schema governs these choices. Existing approaches embed these decisions in pipeline code or extract relations ad hoc, producing schemas that are tightly coupled to their construction process and difficult to reuse for downstream ontology-level tasks. We present an ontology-oriented approach in which the schema is designed from the outset for ontology analysis, entity disambiguation, domain customization, and LLM-guided extraction -- not merely as a byproduct of graph building. The core mechanism is intrinsic-relational routing, which classifies every property as either intrinsic or relational and routes it to the corresponding schema module. This routing produces a declarative schema that is portable across storage backends and independently reusable. We instantiate the approach on the January 2026 Wikidata dump. A rule-based cleaning stage identifies a 34.6M-entity core set from the full dump, followed by iterative intrinsic-relational routing that assigns each property to one of 94 modules organized into 8 categories. With tool-augmented LLM support and human review, the schema reaches 93.3% category coverage and 98.0% module assignment among classified entities. Exporting this schema yields a property graph with 34.0M nodes and 61.2M edges across 38 relationship types. We validate the ontology-oriented claim through five applications that consume the schema independently of the construction pipeline: ontology structure analysis, benchmark annotation auditing, entity disambiguation, domain customization, and LLM-guided extraction.

Related papers

• Unifying Graph Neural Networks Through a Common Layer Equation [75.88127999406392]
  We introduce a common layer equation that represents covered architectures through seven components.<n>The central factorization separates where information moves, encoded by the propagation bank, from what moves, encoded by the message maps.<n>We make this unification explicit and checkable through worked reductions of canonical layers and component assignments.
  arXiv  Detail & Related papers  (2026-08-17T04:37:59Z)
• CRAFT: Learn the Schema, Execute the Plan [1.4711904351495848]
  We present CRAFT, a two-stage post-training recipe for schema-grounded coding agents.<n>First, schema-stripped PLAN supervised fine-tuning learns domain-structured plans and executable behaviors from validated trajectories.<n>Second, execution-shaped reinforcement learning aligns the policy for tool selection, code quality, plan-code consistency, and recovery from failed executions.
  arXiv  Detail & Related papers  (2026-06-24T00:12:03Z)
• Executable Schema Contracts: From Automatic Ingestion to Multi-Source Retrieval [19.3757623473603]
  Real-world data spans tables, documents, and semi-structured files with implicit semantics.<n>We present a system that automatically discovers an executable schema from raw multi-source data.
  arXiv  Detail & Related papers  (2026-06-03T20:28:36Z)
• Tracing the Roots: A Multi-Agent Framework for Uncovering Data Lineage in Post-Training LLMs [81.43302841109349]
  Post-training data plays a pivotal role in shaping the capabilities of Large Language Models (LLMs)<n>We propose an automated multi-agent framework to reconstruct the evolutionary graph of dataset development.
  arXiv  Detail & Related papers  (2026-04-12T06:24:07Z)
• Retrieving Minimal and Sufficient Reasoning Subgraphs with Graph Foundation Models for Path-aware GraphRAG [27.22974957852695]
  Graph-based retrieval-augmented generation (GraphRAG) exploits structured knowledge to support knowledge-intensive reasoning.<n>We propose GFM-Retriever that directly responds to user queries with a subgraph, where a pre-trained Graph Foundation Model acts as a cross-domain Retriever.<n>GFM-Retriever achieves state-of-the-art performance in both retrieval quality and answer generation, while maintaining efficiency.
  arXiv  Detail & Related papers  (2026-03-07T12:39:21Z)
• LLM-Driven Ontology Construction for Enterprise Knowledge Graphs [0.0]
  This paper introduces OntoEKG, a pipeline designed to accelerate the generation of domain-specific unstructured from enterprise data.<n>Our approach decomposes the modelling task into two distinct phases: an extraction module that identifies core classes and properties, and an entailment module that logically these elements into a hierarchy before serialising them into standard RDF.<n>Addressing the significant lack of comprehensive benchmarks for end-to-end construction, we adopt a new evaluation dataset derived from documents across the Data, Finance, and Logistics sectors.
  arXiv  Detail & Related papers  (2026-02-01T15:13:30Z)
• Follow the Flow: Fine-grained Flowchart Attribution with Neurosymbolic Agents [106.04963073116468]
  Flowcharts are a critical tool for visualizing decision-making processes.<n> vision-language models frequently hallucinate nonexistent connections and decision paths when analyzing these diagrams.<n>We introduce Fine-grained Flowchart, which traces specific components grounding a flowchart referring LLM response.<n>We propose FlowPathAgent, a neurosymbolic agent that performs fine-grained post hoc attribution through graph-based reasoning.
  arXiv  Detail & Related papers  (2025-06-02T06:02:41Z)
• AutoSchemaKG: Autonomous Knowledge Graph Construction through Dynamic Schema Induction from Web-Scale Corpora [51.77079220622184]
  We present AutoKG, a framework for fully autonomous knowledge graph construction.<n>We leverage large language models to simultaneously extract knowledge triples and induce comprehensive schemas directly from text.<n>We construct ATLAS (Automated Triple Linking And Induction), a family of knowledge graphs with 900+ million nodes and 5.9 billion edges.
  arXiv  Detail & Related papers  (2025-05-29T16:34:58Z)
• Schema-adaptable Knowledge Graph Construction [47.772335354080795]
  Conventional Knowledge Graph Construction (KGC) approaches typically follow the static information extraction paradigm with a closed set of pre-defined schema. We propose a new task called schema-adaptable KGC, which aims to continually extract entity, relation, and event based on a dynamically changing schema graph without re-training.
  arXiv  Detail & Related papers  (2023-05-15T15:06:20Z)
• Neural Production Systems [90.75211413357577]
  Visual environments are structured, consisting of distinct objects or entities. To partition images into entities, deep-learning researchers have proposed structural inductive biases. We take inspiration from cognitive science and resurrect a classic approach, which consists of a set of rule templates. This architecture achieves a flexible, dynamic flow of control and serves to factorize entity-specific and rule-based information.
  arXiv  Detail & Related papers  (2021-03-02T18:53:20Z)
• Bipartite Flat-Graph Network for Nested Named Entity Recognition [94.91507634620133]
  Bipartite flat-graph network (BiFlaG) for nested named entity recognition (NER) We propose a novel bipartite flat-graph network (BiFlaG) for nested named entity recognition (NER)
  arXiv  Detail & Related papers  (2020-05-01T15:14:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.