AI curriculum
Course outline for Knowledge Graph Engineering
A graph can duplicate entities or turn unsupported extracted relationships into apparent facts. Convert a small relational dataset into one graph model with stable identities and reviewed assertions. Test repeatable ingestion, conflicting sources, and retirement of outdated claims.
- Technology
- Knowledge Engineering
- Duration
- 6 hours
- Modules
- 3 · 2 hours each
- Level
- Level 2
About Knowledge Graph Engineering
A graph can duplicate entities or turn unsupported extracted relationships into apparent facts. Convert a small relational dataset into one graph model with stable identities and reviewed assertions. Test repeatable ingestion, conflicting sources, and retirement of outdated claims.
Knowledge Graph Engineering Course Objectives
- Define a graph schema and distinguish identifiers from labels.
- Resolve duplicates using explicit criteria and hold ambiguous matches for review.
- Query multi-hop relationships with source references.
- Validate candidate assertions before ingestion and test rerun behavior.
- Supersede an assertion while retaining its source and validity history.
Pre-requisites
- Basic data modeling, query, and database-selection experience.
- Familiarity with scripting or data transformation and explicit domain relationships.
Before this course
Complete the required courses or bring equivalent experience. Recommended courses add useful depth; they are not enrolment gates.
Required preparation
Recommended preparation
Can model knowledge and choose/query a data store before building and maintaining graphs; RDF and SQL depth are useful but not universally required.
Find your place in the learning mapLab Setup
- Programming runtime and one preconfigured local graph database or graph library with an ingestion starter and prepared query examples.
- Synthetic relational records, candidate triples, duplicate/ambiguous entities, and conflicting source fixtures.
- No hosted database, concurrent production ingestion, or model account is required.
Detailed Course Outline
Module 1: Establish structure and identity
- Knowledge graph modelling: Map relational entities and keys into one local graph model while preserving identifiers, source evidence, and relationship meanings.
- Graph schemas: Define entity and relationship structure with stable keys, distinguishing schema rules from labels and individual accepted assertions.
- Graph databases: Select a local graph representation for supplied relationship queries and map its storage responsibilities to the relational source.
Practical outcome: Select one local graph model and map relational entities and keys to its schema.
Module 2: Resolve entities and inspect relationships
- Entity resolution: Apply explicit duplicate-matching criteria and hold ambiguous matches for human review instead of silently merging similarly named entities.
- Relationship modelling: Distinguish relationship, temporal, dependency, and causal edges so a connection or chronological sequence cannot silently imply causation.
- Querying: Answer multi-hop questions with source references and separate current accepted assertions from conflicting or retired historical evidence.
Practical outcome: Apply reviewed identity rules and query multi-hop relationships while distinguishing relationship, temporal, dependency, and causal edge meanings.
Module 3: Ingest and maintain reviewable assertions
- Knowledge graph construction: Validate candidate relationships before ingestion and verify that repeated source loading leaves entity and accepted-assertion counts unchanged.
- Knowledge graph maintenance: Supersede outdated assertions while retaining source and validity history, excluding retired claims from the current view.
- Source-qualified assertions: Attach source and validity fields to reviewed facts so conflicting evidence remains queryable without presenting every claim as accepted.
Practical outcome: Ingest accepted candidate facts with source and validity fields, then supersede an assertion without deleting its history.
Practical exercise
- Produce a local graph, repeatable ingestion script, identity-review report, and source-qualified assertion queries.
- Load valid relational records; reject an unsupported relationship and hold an ambiguous entity match for review.
- Rerun ingestion and verify unchanged entity and accepted-assertion counts; answer three supplied multi-hop queries.
- Query conflicting sources and retire an outdated assertion, preserving historical evidence while excluding it from the current view.
What you will produce
Construct and maintain a small graph with stable identities and reviewable assertion history.
How the work is checked
- Identity rules reject duplicate creation and expose ambiguous matches.
- Unsupported candidate relationships are not inserted as accepted facts.
- Rerun counts and three multi-hop queries match expected results.
- Current and historical views correctly handle conflict and supersession.
Six-hour lab in one graph model; assertion history is bounded, not full temporal-database or concurrent-maintenance engineering. Provenance does not prove causal truth.
When another approach is better
- Use relational joins when graph traversal does not improve the workload enough to justify another store.
- Do not automate entity merges when available evidence cannot establish identity.
How we train
Contact us for full course details, including duration, delivery options and lab requirements.
Ask about exercises, instructor feedback and the prior knowledge you need. Tool-specific courses marked provisional may become modules in a broader course.
Discuss your learning goalsRelated Courses
These courses list this course as preparation.