arXiv:1606.04223
Learning Term Weights for Ad-hoc Retrieval
원문 초록
Most Information Retrieval models compute the relevance score of a document for a given query by summing term weights specific to a document or a query. Heuristic approaches, like TF-IDF, or probabilistic models, like BM25, are used to specify how a term weight is computed. In this paper, we propose to leverage learning-to-rank principles to learn how to compute a term weight for a given document based on the term occurrence pattern.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
JointRank: Rank Large Set with Single Pass
From Web Search towards Agentic Deep Research: Incentivizing Search with Reasoning Agents
DeepResearch Bench: A Comprehensive Benchmark for Deep Research Agents
Exp4Fuse: A Rank Fusion Framework for Enhanced Sparse Retrieval using Large Language Model-based Query Expansion
Retrieval Augmented Generation based Large Language Models for Causality Mining
From Chaos to Automation: Enabling the Use of Unstructured Data for Robotic Process Automation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.