首页|期刊导航|Journal of Data and Information Science|Is more always better?Measuring the quality of ranking data through information entropy

Is more always better?Measuring the quality of ranking data through information entropyOA

中文摘要

Purpose:Rank aggregation plays a crucial role in various academic and practical applications.However,accurately assessing the quality of ranking data remains a critical challenge.This study aims to propose methods for assessing the quality of ranking data from the perspective of its distribution.Design/methodology/approach:This study adopts a network science perspective,transforming ranking data into a network and evaluating its quality using network structural entropy.In addition,we extended three commonly used ranking data generation models to produce ranking data with different distribution characteristics.Finally,the effectiveness of the proposed methods was validated using both synthetic and real-world data.Findings:Through experiments,we validated the effectiveness of the proposed methods in assessing the quality of ranking data from the perspective of distribution.Additionally,the study revealed the following:(1)simply increasing the number of input rankings does not necessarily improve data quality;(2)when dealing with unevenly distributed ranking data,different aggregation methods exhibit significant differences in performance;and(3)increasing the length of input rankings can mitigate the decline in aggregation effectiveness caused by the uneven probability of each object being ranked.Research limitations:(1)This study focuses on the impact of distribution characteristics on the quality of ranking data,without considering the effect of disagreements within the data;(2)although the proposed methods have been validated on synthetic and real-world datasets,their generalizability may still require further testing on more diverse datasets.Practical implications:The methods proposed in this study enables researchers and information managers to more accurately assess the quality of input data before performing rank aggregation,thereby enhancing decision-making reliability.Originality/value:This study proposes two novel methods from the perspective of network science to address the challenge of data quality assessment in rank aggregation,providing both theoretical support and practical insights for related fields.

Yishan Liu;Yu Xiao;Xin Long;Jun Wu

Department of Systems Science,Faculty of Arts and Sciences,Beijing Normal University,Zhuhai 519087,China International Academic Center of Complex Systems,Beijing Normal University,Zhuhai 519087,China School of Systems Science,Beijing Normal University,Beijing 100875,ChinaDepartment of Systems Science,Faculty of Arts and Sciences,Beijing Normal University,Zhuhai 519087,China International Academic Center of Complex Systems,Beijing Normal University,Zhuhai 519087,ChinaCollege of Electronic Science and Technology,National University of Defense Technology,Changsha 410073,ChinaDepartment of Systems Science,Faculty of Arts and Sciences,Beijing Normal University,Zhuhai 519087,China International Academic Center of Complex Systems,Beijing Normal University,Zhuhai 519087,China

社会科学

Multiple criteria decision makingRank aggregationData qualityMeasuringInformation entropy

《Journal of Data and Information Science》 2026 (1)

P.76-95,20

financially supported by the National Natural Science Foundation of China(Nos.72571031,72401032,72201035)the Innovation Teams Project in Ordinary Universities of Guangdong Province(No.2024KCXTD050)the Guangdong Basic and Applied Basic Research Foundation(No.2025A1515011586).

10.2478/jdis-2025-0055

评论