研究人员开发了因子化假设搜索（FHS），这是一种改进证据到分类法检索的新方法，解决了间接证据未明确链接到目标概念的“检索就绪差距”。FHS通过在语义维度上维护多个部分解释来工作，从而实现结构化查询渲染和候选验证。与现有方法相比，该方法在金融分类标记和临床编码任务的Recall@1、MRR和准确性方面表现出优越的性能。 AI
影响 该方法可以提高AI系统在需要对间接证据进行分类的任务中的准确性，例如金融分析和临床编码。
排序理由 该集群包含一篇详细介绍证据到分类法检索新方法的学术论文。
在 Hugging Face Daily Papers 阅读 →
AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →
完整方法见我们的编辑标准。
arXiv:2608.06614v1 Announce Type: cross Abstract: Large-taxonomy retrieval often assumes that the input already expresses the target concept. In many settings, however, the input is indirect evidence, such as a table cell whose meaning depends on its row, column, datatype, and co…
Large-taxonomy retrieval often assumes that the input already expresses the target concept. In many settings, however, the input is indirect evidence, such as a table cell whose meaning depends on its row, column, datatype, and context. We call this mismatch the retrieval readine…