Ontology matching for defence, intelligence & security
DISO-OAEI distributes ten curated ontologies spanning cyber security,
command & control, and smart environments — and evaluates matching systems on
two tasks: classic global alignment against a repaired silver standard,
and candidate ranking with explicit NIL abstention.
Task 1 measures whole-alignment quality the traditional OAEI way; Task 2 isolates
local decision quality — including knowing when no match exists.
Task 16 pairsreferences public
Global alignment
Submit one full OAEI Alignment RDF per pair. Scored with partiality-corrected
precision, recall and F1 — micro- and macro-averaged — against the repaired
silver standard R⁺≈, with the unrepaired R≈ as secondary.
Self-score locally with the provided tools.
For each source entity, rank a fixed 50-candidate pool best-first — placing the
NIL candidate early to abstain when no equivalent exists. Unsupervised;
scored organiser-side with Hits@{1,3,5,10} and MRR, macro-averaged
over both pairs.
The best-performing systems of the 2026 evaluation, from the final
CodaBench leaderboards and,
for Task 1, the systems run by the organisers (marked). Full standings, with notes on
the organiser-run systems: results.
Task 1 — global alignment
#
System
Micro-F1, R⁺≈
1
LogMapLLMFamily used to build the referenceLogMapLLM belongs to the LogMap family of matchers, one of the families whose consensus
votes produced the partial reference alignments (before manual review and repair). Bear this
in mind when comparing its scores with those of other systems.
0.870
2
LogMapFamily used to build the referenceLogMap belongs to the LogMap family of matchers, one of the families whose consensus
votes produced the partial reference alignments (before manual review and repair). Bear this
in mind when comparing its scores with those of other systems.
0.858
3
LogMapKGFamily used to build the referenceLogMapKG belongs to the LogMap family of matchers, one of the families whose consensus
votes produced the partial reference alignments (before manual review and repair). Bear this
in mind when comparing its scores with those of other systems.
organiser run
0.856
4
MOSAIC-cli organiser run
0.569
5
MatchaFamily used to build the referenceMatcha belongs to the Matcha family of matchers, one of the families whose consensus
votes produced the partial reference alignments (before manual review and repair). Bear this
in mind when comparing its scores with those of other systems.
0.550
Task 2 — equivalence ranking
#
System
MRR (macro)
1
Matcha
0.725
Data
Downloads
The 2026 datasets are published on the Hugging Face Hub:
OAEI-ML/diso-oaei
(the v2026 tag
pins this edition). Verify your copies against the SHA-256 checksums below — they were
computed from the bytes served by Hugging Face and re-verified against the repository's
canonical files.
Prefer the CLI? hf download OAEI-ML/diso-oaei --repo-type dataset
(see the quickstart). Individual ontologies and
per-pair reference files are listed on the
ontologies and Task 1 pages.
Reference alignment creation methodology:
diso-mappings.
Timeline
2026 edition
ℹ
The 2026 competition has concluded. Evaluation closed on 30 September
2026, and the final results, covering the CodaBench submissions and the systems run by the
organisers, are on the results page. The CodaBench
portals remain available for reference:
Task 1 — Global Alignment ·
Task 2 — Local Equivalence Ranking.
As with every OAEI track, your system must be registered with the
OAEI 2026 campaign (via its
registration form) before you submit; a CodaBench account alone
is not OAEI registration. All dates are
00:00 AoE.
30 June 2026Provisional Materials Releaseddelivered
6 July 2026Finalised Datasets Publisheddelivered
12 July 2026Competition Started, Evaluation + Leaderboard Openedcomplete
30 September 2026Evaluation Closedcomplete
4 October 2026Competition Concluded, Final Results Reportedcomplete
The network
Ten DISO-curated ontologies
Drawn from the DISO collection —
publicly available ontologies for defence, intelligence, national security, and
operationally adjacent domains.