<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithms on Vubon Notes</title><link>https://vubon.dev/tags/algorithms/</link><description>Recent content in Algorithms on Vubon Notes</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 04 Oct 2026 12:00:00 +0700</lastBuildDate><atom:link href="https://vubon.dev/tags/algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>Understanding Cosine Similarity: From Math to Bare-Metal Vector Search</title><link>https://vubon.dev/posts/understanding-cosine-similarity-in-vector-search/</link><pubDate>Sun, 04 Oct 2026 12:00:00 +0700</pubDate><guid>https://vubon.dev/posts/understanding-cosine-similarity-in-vector-search/</guid><description>&lt;p>If you have spent any time working with Large Language Models, Retrieval-Augmented Generation (RAG), or vector databases, you have seen this term everywhere:&lt;/p>
&lt;p>&lt;strong>Cosine Similarity.&lt;/strong>&lt;/p>
&lt;p>When you ask an AI assistant a question, the system converts your text into a list of numbers (an embedding), compares it against millions of stored vectors, and returns the most relevant chunks.&lt;/p>
&lt;p>Almost every vector database tells you: &lt;em>&amp;ldquo;We use cosine similarity to rank semantic relevance.&amp;rdquo;&lt;/em>&lt;/p></description></item></channel></rss>