基于链接预测的有限信息排名汇总

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-08-02 DOI:10.1016/j.ipm.2024.103860
{"title":"基于链接预测的有限信息排名汇总","authors":"","doi":"10.1016/j.ipm.2024.103860","DOIUrl":null,"url":null,"abstract":"<div><p>Rank aggregation is a vital tool in facilitating decision-making processes that consider multiple criteria or attributes. While in many applications, the available ranked lists are often limited and quite partial for various reasons. This scarcity of ranking information presents a significant challenge to rank aggregation effectiveness. To address this problem of rank aggregation with limited information, in this study, on the basis of networked representation of ranking information, we employ the link prediction technology to mine potential ranking information. It aims to optimize the aggregation process, and maximize the aggregation effectiveness using available limited information. Experimental results indicate that our proposed approach can significantly enhance the aggregation effectiveness of existing rank aggregation methods, such as Borda’s method, competition graph method and Markov chain method. Our work provides a new way to solve rank aggregation problem with limited information and develops a new research paradigm for future rank aggregation studies from the perspective of network science.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4000,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rank aggregation with limited information based on link prediction\",\"authors\":\"\",\"doi\":\"10.1016/j.ipm.2024.103860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Rank aggregation is a vital tool in facilitating decision-making processes that consider multiple criteria or attributes. While in many applications, the available ranked lists are often limited and quite partial for various reasons. This scarcity of ranking information presents a significant challenge to rank aggregation effectiveness. To address this problem of rank aggregation with limited information, in this study, on the basis of networked representation of ranking information, we employ the link prediction technology to mine potential ranking information. It aims to optimize the aggregation process, and maximize the aggregation effectiveness using available limited information. Experimental results indicate that our proposed approach can significantly enhance the aggregation effectiveness of existing rank aggregation methods, such as Borda’s method, competition graph method and Markov chain method. Our work provides a new way to solve rank aggregation problem with limited information and develops a new research paradigm for future rank aggregation studies from the perspective of network science.</p></div>\",\"PeriodicalId\":50365,\"journal\":{\"name\":\"Information Processing & Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.4000,\"publicationDate\":\"2024-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Processing & Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S030645732400219X\",\"RegionNum\":1,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030645732400219X","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

排名汇总是促进决策过程的一个重要工具,它需要考虑多个标准或属性。但在许多应用中,由于各种原因,可用的排序列表往往是有限的,而且相当片面。这种排名信息的稀缺性对排名聚合的有效性提出了巨大挑战。为了解决信息有限的排名聚合问题,本研究在排名信息网络化表示的基础上,采用链接预测技术挖掘潜在的排名信息。其目的是优化聚合过程,利用现有的有限信息最大限度地提高聚合效果。实验结果表明,我们提出的方法可以显著提高现有排名聚合方法的聚合效果,如博尔达方法、竞争图方法和马尔科夫链方法。我们的工作为解决信息有限的等级聚合问题提供了一种新方法,并从网络科学的角度为未来的等级聚合研究开发了一种新的研究范式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Rank aggregation with limited information based on link prediction

Rank aggregation is a vital tool in facilitating decision-making processes that consider multiple criteria or attributes. While in many applications, the available ranked lists are often limited and quite partial for various reasons. This scarcity of ranking information presents a significant challenge to rank aggregation effectiveness. To address this problem of rank aggregation with limited information, in this study, on the basis of networked representation of ranking information, we employ the link prediction technology to mine potential ranking information. It aims to optimize the aggregation process, and maximize the aggregation effectiveness using available limited information. Experimental results indicate that our proposed approach can significantly enhance the aggregation effectiveness of existing rank aggregation methods, such as Borda’s method, competition graph method and Markov chain method. Our work provides a new way to solve rank aggregation problem with limited information and develops a new research paradigm for future rank aggregation studies from the perspective of network science.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Fusing temporal and semantic dependencies for session-based recommendation A Universal Adaptive Algorithm for Graph Anomaly Detection A context-aware attention and graph neural network-based multimodal framework for misogyny detection Multi-granularity contrastive zero-shot learning model based on attribute decomposition Asymmetric augmented paradigm-based graph neural architecture search
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1