Milvus(@milvusio)

𝗜𝗻 𝗲-𝗰𝗼𝗺𝗺𝗲𝗿𝗰𝗲 𝗮𝗻𝗱 𝗻𝗲𝘄𝘀 𝘀𝗲𝗮𝗿𝗰𝗵, 𝘀𝗲𝗺𝗮𝗻𝘁𝗶𝗰 𝘀𝗶𝗺𝗶𝗹𝗮𝗿𝗶𝘁𝘆 ...

8.5内容质量
𝗜𝗻 𝗲-𝗰𝗼𝗺𝗺𝗲𝗿𝗰𝗲 𝗮𝗻𝗱 𝗻𝗲𝘄𝘀 𝘀𝗲𝗮𝗿𝗰𝗵, 𝘀𝗲𝗺𝗮𝗻𝘁𝗶𝗰 𝘀𝗶𝗺𝗶𝗹𝗮𝗿𝗶𝘁𝘆 ...

TL;DR · AI 摘要

Milvus通过时间感知排序函数结合语义相似性提升搜索结果时效性,使用衰减模型动态调整文档相关性评分。

核心要点

  • 时间衰减函数将语义相似性与时间戳结合,使近期内容排名更高
  • 三种衰减模型(指数/高斯/线性)支持不同场景的时效性需求
  • 最终评分=归一化相似度×衰减系数,混合搜索取最大相似度值

结构提纲

按章节快速跳转。

  1. 电商/新闻搜索中语义相似性不足以为唯一排序依据

  2. 时间感知排序函数通过衰减模型动态调整文档相关性评分

  3. 距离转换→衰减计算→最终评分三步法实现时效性与相关性平衡

  4. 支持指数/高斯/线性三种模型,可配置起源/尺度/偏移参数

  5. 多向量字段搜索时取最大相似度值再乘衰减系数

思维导图

用一张图看清主题之间的关系。

查看大纲文本(无障碍 / 无 JS 友好)
  • Milvus时间感知排序
    • 核心机制
      • 语义相似性+时间衰减
    • 衰减模型
      • 指数
      • 高斯
      • 线性
    • 评分流程
      • 距离归一化
      • 衰减计算
      • 最终评分乘积

金句 / Highlights

值得收藏与分享的关键句。

#Milvus#向量搜索#时间衰减#电商搜索#新闻搜索
打开原文

Milvus on X: "𝗜𝗻 𝗲-𝗰𝗼𝗺𝗺𝗲𝗿𝗰𝗲 𝗮𝗻𝗱 𝗻𝗲𝘄𝘀 𝘀𝗲𝗮𝗿𝗰𝗵, 𝘀𝗲𝗺𝗮𝗻𝘁𝗶𝗰 𝘀𝗶𝗺𝗶𝗹𝗮𝗿𝗶𝘁𝘆 𝗮𝗹𝗼𝗻𝗲 𝗶𝘀 𝗻𝗼𝘁 𝗲𝗻𝗼𝘂𝗴𝗵 𝘁𝗼 𝗿𝗮𝗻𝗸 𝗿𝗲𝘀𝘂𝗹𝘁𝘀. Milvus's Time-aware Ranking Functions (also called Decay Functions) rerank retrieval results by applying time-decay https://t.co/NK0BLx23nP" / X

Milvus

@milvusio

𝗜𝗻 𝗲-𝗰𝗼𝗺𝗺𝗲𝗿𝗰𝗲 𝗮𝗻𝗱 𝗻𝗲𝘄𝘀 𝘀𝗲𝗮𝗿𝗰𝗵, 𝘀𝗲𝗺𝗮𝗻𝘁𝗶𝗰 𝘀𝗶𝗺𝗶𝗹𝗮𝗿𝗶𝘁𝘆 𝗮𝗹𝗼𝗻𝗲 𝗶𝘀 𝗻𝗼𝘁 𝗲𝗻𝗼𝘂𝗴𝗵 𝘁𝗼 𝗿𝗮𝗻𝗸 𝗿𝗲𝘀𝘂𝗹𝘁𝘀. Milvus's Time-aware Ranking Functions (also called Decay Functions) rerank retrieval results by applying time-decay functions, so recent content ranks higher without sacrificing relevance. Milvus's Decay Functions combining vector similarity with configurable time-decay to dynamically adjust each document's relevance score. 𝗧𝗵𝗲 𝘀𝗰𝗼𝗿𝗶𝗻𝗴 𝘄𝗼𝗿𝗸𝘀 𝗶𝗻 𝘁𝗵𝗿𝗲𝗲 𝘀𝘁𝗲𝗽𝘀: • 𝗖𝗼𝗻𝘃𝗲𝗿𝘁 𝗱𝗶𝘀𝘁𝗮𝗻𝗰𝗲𝘀 𝗶𝗻𝘁𝗼 𝗵𝗶𝗴𝗵𝗲𝗿-𝗶𝘀-𝗯𝗲𝘁𝘁𝗲𝗿 𝘀𝗰𝗼𝗿𝗲𝘀. For L2 and JACCARD (lower = more similar): normalized_score = 1.0 − (2 × arctan(score)) / π. COSINE, IP, and BM25 scores are used directly. • 𝗖𝗼𝗺𝗽𝘂𝘁𝗲 𝗮 𝗱𝗲𝗰𝗮𝘆 𝘀𝗰𝗼𝗿𝗲 from a numeric field like a timestamp, using one of three decay models: exponential, Gaussian, or linear. The result is a value between 0 and 1, representing how close the document is to a reference point (typically "now"). • 𝗠𝘂𝗹𝘁𝗶𝗽𝗹𝘆: final_score = normalized_similarity_score × decay_score. In hybrid search with multiple vector fields, Milvus takes the maximum normalized score first: final_score = max(normalized_scores) × decay_score. Each model takes a configurable origin, scale (the distance beyond the offset at which the score drops to the decay value), and an optional offset (a no-penalty zone around the origin where the score stays at 𝟭.𝟬). 𝗟𝗲𝗮𝗿𝗻 𝗺𝗼𝗿𝗲 𝗵𝗲𝗿𝗲:

milvus.io/docs/decay-ran…

3:00 PM · Jul 16, 2026

206

Views

1

0

2