利用模糊积分算子,通过基于图谱的特征融合学习排序

IF 3.4 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Amir Hosein Keyhanipour
{"title":"利用模糊积分算子,通过基于图谱的特征融合学习排序","authors":"Amir Hosein Keyhanipour","doi":"10.1007/s10489-024-05755-w","DOIUrl":null,"url":null,"abstract":"<div><p>Accurately ranking search results based on user query relevance is a complex, multi-dimensional challenge in information retrieval systems, inherently subject to ambiguity and uncertainty. This inherent complexity stems from the ambiguity and uncertainty surrounding relevance judgments. Factors like imprecise user queries, expert disagreements on relevance, and complex relationships between features of documents and queries all contribute to this. Traditional learning-to-rank algorithms often struggle to handle these uncertainties. This paper proposes a novel approach that leverages Sugeno and Choquet fuzzy integrals to model the uncertainty of features and their interactions. This allows our algorithm to make more nuanced ranking decisions. The proposed approach is extensively evaluated on major benchmark datasets like MSLR-Web10K, Istella LETOR, and WCL2R, demonstrating its effectiveness in outperforming baseline methods across standard criteria such as P@n, MAP, and NDCG@n. Notably, the proposed algorithm ranks top results, which are most crucial for user satisfaction. This practical improvement can benefit web search engines by providing users with more relevant information at the top of their search results.\n</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"54 22","pages":"11914 - 11932"},"PeriodicalIF":3.4000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learning to rank through graph-based feature fusion using fuzzy integral operators\",\"authors\":\"Amir Hosein Keyhanipour\",\"doi\":\"10.1007/s10489-024-05755-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Accurately ranking search results based on user query relevance is a complex, multi-dimensional challenge in information retrieval systems, inherently subject to ambiguity and uncertainty. This inherent complexity stems from the ambiguity and uncertainty surrounding relevance judgments. Factors like imprecise user queries, expert disagreements on relevance, and complex relationships between features of documents and queries all contribute to this. Traditional learning-to-rank algorithms often struggle to handle these uncertainties. This paper proposes a novel approach that leverages Sugeno and Choquet fuzzy integrals to model the uncertainty of features and their interactions. This allows our algorithm to make more nuanced ranking decisions. The proposed approach is extensively evaluated on major benchmark datasets like MSLR-Web10K, Istella LETOR, and WCL2R, demonstrating its effectiveness in outperforming baseline methods across standard criteria such as P@n, MAP, and NDCG@n. Notably, the proposed algorithm ranks top results, which are most crucial for user satisfaction. This practical improvement can benefit web search engines by providing users with more relevant information at the top of their search results.\\n</p></div>\",\"PeriodicalId\":8041,\"journal\":{\"name\":\"Applied Intelligence\",\"volume\":\"54 22\",\"pages\":\"11914 - 11932\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10489-024-05755-w\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-024-05755-w","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在信息检索系统中,根据用户查询的相关性对搜索结果进行精确排序是一项复杂的、多维度的挑战,本身就存在模糊性和不确定性。这种内在的复杂性源于相关性判断的模糊性和不确定性。不精确的用户查询、专家对相关性的意见分歧、文档特征与查询之间的复杂关系等因素都是造成这种情况的原因。传统的学习排名算法往往难以处理这些不确定性。本文提出了一种新方法,利用 Sugeno 和 Choquet 模糊积分来模拟特征的不确定性及其相互作用。这样,我们的算法就能做出更细致入微的排名决策。我们在 MSLR-Web10K、Istella LETOR 和 WCL2R 等主要基准数据集上对所提出的方法进行了广泛评估,结果表明,该方法在 P@n、MAP 和 NDCG@n 等标准标准方面的性能均优于基准方法。值得注意的是,所提出的算法对用户满意度最为关键的结果进行了排名。这种切实可行的改进可以在搜索结果的顶部为用户提供更多相关信息,从而使网络搜索引擎受益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Learning to rank through graph-based feature fusion using fuzzy integral operators

Learning to rank through graph-based feature fusion using fuzzy integral operators

Learning to rank through graph-based feature fusion using fuzzy integral operators

Accurately ranking search results based on user query relevance is a complex, multi-dimensional challenge in information retrieval systems, inherently subject to ambiguity and uncertainty. This inherent complexity stems from the ambiguity and uncertainty surrounding relevance judgments. Factors like imprecise user queries, expert disagreements on relevance, and complex relationships between features of documents and queries all contribute to this. Traditional learning-to-rank algorithms often struggle to handle these uncertainties. This paper proposes a novel approach that leverages Sugeno and Choquet fuzzy integrals to model the uncertainty of features and their interactions. This allows our algorithm to make more nuanced ranking decisions. The proposed approach is extensively evaluated on major benchmark datasets like MSLR-Web10K, Istella LETOR, and WCL2R, demonstrating its effectiveness in outperforming baseline methods across standard criteria such as P@n, MAP, and NDCG@n. Notably, the proposed algorithm ranks top results, which are most crucial for user satisfaction. This practical improvement can benefit web search engines by providing users with more relevant information at the top of their search results.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信