News for hackers. Stuff that matters.
Re:Nearest neighbor indexes for similarity search by IfOnlyYouKnew on Thursday August 12, 2021 @05:35AM (#28154081)
Hmmm… no?

Consider word embedding, where finding the most similar words given some input, you need to do a NN over 300 dimensions. That’s a common task, and it’s largely unsolved. Postgres, for example, allows you to create indices over their „cube“ datatype, but those are slower than the naive brut-force approach.

There are no comments on this comment yet.