krzysztof/landing_page
1
0
Fork 0
mirror of https://github.com/qdrant/landing_page.git synced 2026-10-03 01:48:32 +02:00
Code Issues Packages Projects Releases Wiki Activity

Syntax

Browse Source 
Co-authored-by: Luis Cossío <luis.cossio@qdrant.com>
This commit is contained in:
Dylan Couzon
2026-05-19 19:26:05 -04:00
committed by GitHub
co-authored by Luis Cossío
parent 044dc73080
commit 9114e61b9e
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
qdrant-landing/content/documentation/search/hybrid-queries.md
+1 -1
View File
@@ -92,7 +92,7 @@ Retune when your retrievers change (new embedding model, new chunking), when you
_Available as of v1.11.0_
<a href=https://medium.com/plain-simple-software/distribution-based-score-fusion-dbsf-a-new-approach-to-vector-search-ranking-f87c37488b18 target="_blank">DBSF</a> keeps the raw scores from each query but normalizes their distributions before combining. For each retriever's returned set, it computes the mean $\mu$ and sample standard deviation $\sigma$, then linearly remaps every score using the 3-sigma extremes as endpoints:
<a href=https://medium.com/plain-simple-software/distribution-based-score-fusion-dbsf-a-new-approach-to-vector-search-ranking-f87c37488b18 target="_blank">DBSF</a> keeps the raw scores from each query but normalizes their distributions before combining. For each retriever's returned set, it computes the mean $\mu$ and sample standard deviation $\sigma$, then normalizes every score using the 3-sigma extremes as endpoints:
$$ \hat{s} = \frac{s - (\mu - 3\sigma)}{6\sigma} $$