Incremental refinement of relevance rankings: Balancing relevance depth and scope

IF 5.1 2区 管理学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Müge Akbulut, Yaşar Tonta
{"title":"Incremental refinement of relevance rankings: Balancing relevance depth and scope","authors":"Müge Akbulut,&nbsp;Yaşar Tonta","doi":"10.1002/asi.70101","DOIUrl":null,"url":null,"abstract":"<p>Delivering both relevant and topically diverse results is a key challenge in information retrieval (IR). This study introduces a hybrid method that incrementally refines rankings by combining probabilistic topic modeling (latent dirichlet allocation [LDA]) with citation-based pennant retrieval grounded in Relevance Theory (RT), optimizing for both relevance and diversity. A unified scoring function fuses topic and citation cues, while a tunable weight parameter makes the relevance–diversity trade-off explicit and transparent. Applying this RT-guided approach to the iSearch corpus (435,000 physics papers, 3.7 million citations) across 65 queries, we evaluate relevance and diversity via degree centrality, arXiv subject categories, and maximal marginal relevance (MMR). Unlike prior methods that apply LDA or pennant retrieval separately—or depend on post-hoc diversification such as MMR—this approach integrates them directly and efficiently: LDA runs on local multi-core CPUs, and pennant retrieval operates using sparse co-citation counts. The combined technique retrieves both central and peripheral works, producing a boundary-spanning effect that broadens conceptual coverage while improving normalized discounted cumulative gain (NDCG) performance. Interactive visualizations via LuminaCite depict how researchers can fine-tune results in real time to reveal latent or interdisciplinary connections. Sensitivity and robustness tests indicate that the proposed model is robust to hyperparameter variation, first-stage retriever choice, and query reformulation.</p>","PeriodicalId":48810,"journal":{"name":"Journal of the Association for Information Science and Technology","volume":"77 10","pages":"1247-1270"},"PeriodicalIF":5.1000,"publicationDate":"2026-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/asi.70101","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Association for Information Science and Technology","FirstCategoryId":"91","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/asi.70101","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/5 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Delivering both relevant and topically diverse results is a key challenge in information retrieval (IR). This study introduces a hybrid method that incrementally refines rankings by combining probabilistic topic modeling (latent dirichlet allocation [LDA]) with citation-based pennant retrieval grounded in Relevance Theory (RT), optimizing for both relevance and diversity. A unified scoring function fuses topic and citation cues, while a tunable weight parameter makes the relevance–diversity trade-off explicit and transparent. Applying this RT-guided approach to the iSearch corpus (435,000 physics papers, 3.7 million citations) across 65 queries, we evaluate relevance and diversity via degree centrality, arXiv subject categories, and maximal marginal relevance (MMR). Unlike prior methods that apply LDA or pennant retrieval separately—or depend on post-hoc diversification such as MMR—this approach integrates them directly and efficiently: LDA runs on local multi-core CPUs, and pennant retrieval operates using sparse co-citation counts. The combined technique retrieves both central and peripheral works, producing a boundary-spanning effect that broadens conceptual coverage while improving normalized discounted cumulative gain (NDCG) performance. Interactive visualizations via LuminaCite depict how researchers can fine-tune results in real time to reveal latent or interdisciplinary connections. Sensitivity and robustness tests indicate that the proposed model is robust to hyperparameter variation, first-stage retriever choice, and query reformulation.

相关性排名的增量细化:平衡相关性深度和范围
提供相关和主题多样化的结果是信息检索(IR)中的一个关键挑战。本研究引入了一种混合方法,通过结合概率主题建模(潜狄利let分配[LDA])和基于关联理论(RT)的基于引用的三角旗检索,对相关性和多样性进行优化,逐步改进排名。统一的评分功能融合了主题和引用线索,而可调的权重参数使相关性-多样性权衡明确透明。将这种rt引导方法应用于iSearch语料库(435,000篇物理论文,370万次引用)的65个查询,我们通过度中心性、arXiv主题类别和最大边际相关性(MMR)来评估相关性和多样性。与之前单独应用LDA或三角旗检索或依赖于事后多样化(如mmr)的方法不同,这种方法直接有效地集成了它们:LDA在本地多核cpu上运行,而三角旗检索使用稀疏的共引计数进行操作。该组合技术同时检索中心和外围工作,产生跨边界效应,扩大概念覆盖范围,同时提高归一化贴现累积增益(NDCG)性能。通过LuminaCite的交互式可视化描述了研究人员如何实时微调结果,以揭示潜在的或跨学科的联系。灵敏度和鲁棒性测试表明,该模型对超参数变化、第一阶段检索对象选择和查询重构具有鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.30
自引率
8.60%
发文量
115
期刊介绍: The Journal of the Association for Information Science and Technology (JASIST) is a leading international forum for peer-reviewed research in information science. For more than half a century, JASIST has provided intellectual leadership by publishing original research that focuses on the production, discovery, recording, storage, representation, retrieval, presentation, manipulation, dissemination, use, and evaluation of information and on the tools and techniques associated with these processes. The Journal welcomes rigorous work of an empirical, experimental, ethnographic, conceptual, historical, socio-technical, policy-analytic, or critical-theoretical nature. JASIST also commissions in-depth review articles (“Advances in Information Science”) and reviews of print and other media.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书