own work

by Brian Busemeyer

BK-Tree

BK-Tree is an efficient method for determining the closest member of a set to another point outside the set.

Presentation Summary

In this presentation, I present how BK Trees work. They are a data structure that enables efficient determinations of the closest member of a set to another point outside the set. A common example is spell checking, where the set is a word dictionary and the outside set is a misspelled word. The algorithm only requires that a proper metric is defined for the set, and works using the triangle inequality.

Examples

My BK Tree implementation.

All optimization.