by Brian Busemeyer
BK-Tree
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
All optimization.
- Kevin Kleiner: Algorithm Interest Group on March 22, 2021 · Exploring Stochastic Gradient Descent and its Modifications
- by Yubo "Paul" Yang · Linear Sum Assignment
- by Kevin Ly · PSLQ
- by Chad Germany · Simulated Annealing
- by Brian Busemeyer · BK-Tree
- by Brian Busemeyer · Simulated annealing
- by Brian Busemeyer · Cellular Automaton
- by Juha Tiihonen · Automatic focusing of cameras
- by Yubo "Paul" Yang · Particle Swarm Optimization
- by Brian Busemeyer · Evolutionary algorithms
Yubo "Paul" Yang ALGORITHM
optimization