Entity Resolution: From Score to Identity

Created by Abhyuday DesaiPublished , v1Runs 8 min
0 views

About this video

The second half of entity resolution. Two cut points divide the score scale into reject, review and merge, and choosing them depends on which error costs more. A reviewer confirms the pair in the middle band, a canonical entity is assigned, and its values are chosen field by field from the source records, selecting the raw value and then normalizing. Every decision is stored with its provenance so a merge can be revised later, and a final example shows why approximate matches are not transitive.

You'll learn how to:

  • Set and justify two thresholds by what a wrong merge and a missed match each cost
  • Assign a canonical identity and keep the mapping to each system's local id explicit
  • Choose surviving values field by field, with lineage that never pretends a source stored the cleaned value
  • Keep merges reversible, and avoid building clusters from chains of pairwise evidence

For developers who own the identity layer under a graph or a warehouse.

What changed

  1. v103 Oct 2026abhydesai8 min21ba95b

    First published version.

    0 views0 likes on this version