Unverified50% confidenceFactExact time
NDCG@K takes into account both relevance strength and ranking position, assigning a relevance score to the document at each position and applying logarithmic discounting by ranking position, and finally dividing by the ideal ranking score for normalization so that the result falls between 0 and 1.
1
Sources
50%
Confidence
Long-term
Relevance
10/13/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedRecall@k衡量前k个检索结果中是否包含所有相关文档，nDCG@k考虑相关文档的排名位置并归一化使不同查询可比，两者是检索评估的黄金标准，BEIR基准即采用它们。68% similarUnverifiedThe anchor divergence method operates on fixed representations and obtains similarity metrics oriented toward different semantic requirements by specifying different anchor distributions, without retraining the encoder.66% similarUnverifiedThe core mechanism of RASS is based on rank-aware list coupling, comprising three steps: sorting candidates by proposal-target mean shift, sampling ranks with optimized weights, and maximum coupling with residual correction.64% similarUnverifiedRRF (Reciprocal Rank Fusion) weights and sums the results of two retrieval streams by the reciprocal of their ranks, requiring no score normalization, and is simple to implement with strong robustness.63% similarUnverifiedPlacing the most relevant chunks at the beginning or end of the prompt rather than arranging them in order of retrieval score often improves generation quality.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1015439API
curl https://kongchang.com/api/v1/knowledge/claims/1015439MCP
get_claim(id=1015439)