K-Nearest Embeddings Blocking

Become familiar with vector databases and their use for efficient index blocking.

Indexing in entity resolution helps address the main computational challenge, which is the large number of potential candidate pairs. Traditional methods rely on the following:

  • Lexical matching (also known as exact matching), such as SB

  • Lexical sorting, like in SN

Both methods work within the original feature space. Let’s explore how to measure similarity in a vector space and how to complement lexical by semantic search.

Concept

Let r1,,rnr_1,\ldots,r_n ...

Get hands-on with 1400+ tech skills courses.