…and what are they used for?
k
, similarity search is the process of finding the k
-nearest vectors to your query vector. When calculating how “close” two vectors are from each other, we can use one of the three similarity metrics supported in EigenDB.
Similarity metrics are mathematical methods of defining the distance between two vectors. You are probably most familiar with the Euclidean similarity metric.
k
-most similar songs to a target song, where all songs are represented as vectors.
There is a great episode of the NerdOut@Spotify podcast that talks about their recommendation engine and vector databases as a whole. Highly recommend it.