A robust rating aggregation method based on temporal coupled bipartite network

IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2025-07-01 Epub Date: 2025-02-28 DOI:10.1016/j.ipm.2025.104105
Huan Zhu , Yu Xiao , Dongmei Chen , Jun Wu
{"title":"A robust rating aggregation method based on temporal coupled bipartite network","authors":"Huan Zhu ,&nbsp;Yu Xiao ,&nbsp;Dongmei Chen ,&nbsp;Jun Wu","doi":"10.1016/j.ipm.2025.104105","DOIUrl":null,"url":null,"abstract":"<div><div>As rating expresses preferences in online or offline evaluation tasks, aggregating diverse ratings provided by raters is an essential process for thoroughly assessing the quality of an object, which can aid in decision-making and recommendation. Eliminating the impact of rating distortion on certain objects has attracted significant attention from researchers to design robust rating aggregation methods. However, existing methods are constrained by massive distorting ratings, which usually emerge mainly in specific temporal ranges, namely temporal burstiness. Therefore, we propose a novel robust rating aggregation method based on a temporal coupled bipartite network, which can effectively model the segmentation of ratings to deal with the burstiness. Experimental results and analyses indicate that our method exhibits greater robustness than state-of-the-art methods, particularly in handling significant disturbances occurring within specific temporal intervals. This novel approach holds potential for application in real-time rating platforms.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 4","pages":"Article 104105"},"PeriodicalIF":6.9000,"publicationDate":"2025-07-01","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/S0306457325000470","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/28 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

As rating expresses preferences in online or offline evaluation tasks, aggregating diverse ratings provided by raters is an essential process for thoroughly assessing the quality of an object, which can aid in decision-making and recommendation. Eliminating the impact of rating distortion on certain objects has attracted significant attention from researchers to design robust rating aggregation methods. However, existing methods are constrained by massive distorting ratings, which usually emerge mainly in specific temporal ranges, namely temporal burstiness. Therefore, we propose a novel robust rating aggregation method based on a temporal coupled bipartite network, which can effectively model the segmentation of ratings to deal with the burstiness. Experimental results and analyses indicate that our method exhibits greater robustness than state-of-the-art methods, particularly in handling significant disturbances occurring within specific temporal intervals. This novel approach holds potential for application in real-time rating platforms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于时间耦合二部网络的鲁棒评级聚合方法
由于评分表达了在线或离线评估任务中的偏好,因此汇总评分者提供的各种评分是彻底评估对象质量的必要过程,这有助于决策和推荐。消除评级失真对特定对象的影响是设计稳健的评级聚合方法的重要课题。然而,现有的方法受到大量失真等级的限制,这些失真等级通常主要出现在特定的时间范围内,即时间突发性。因此,我们提出了一种新的基于时间耦合二部网络的鲁棒评级聚合方法,该方法可以有效地对评级分割进行建模以处理突发性。实验结果和分析表明,我们的方法比最先进的方法具有更强的鲁棒性,特别是在处理特定时间间隔内发生的重大干扰时。这种新颖的方法在实时评级平台中具有应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
PhiMark: watermarking relational data robustly with zero distortion A self-guided few-shot semantic segmentation model based on query foreground-background similarity Emotion and noise-robust speaker identification via filter-free self-supervised learning TemFRC: Enterprise financial risk prediction with temporal folding and risk contrast A dual-source knowledge distillation framework for hate speech detection based on cognitive distortion awareness
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1