{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T07:03:12Z","timestamp":1785222192979,"version":"3.55.0"},"reference-count":58,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T00:00:00Z","timestamp":1762473600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,2,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Purpose<\/jats:title>\n                    <jats:p>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.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Design\/methodology\/approach<\/jats:title>\n                    <jats:p>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.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Findings<\/jats:title>\n                    <jats:p>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.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Research limitations<\/jats:title>\n                    <jats:p>(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.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Practical implications<\/jats:title>\n                    <jats:p>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.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Originality\/value<\/jats:title>\n                    <jats:p>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.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.2478\/jdis-2025-0055","type":"journal-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T22:24:11Z","timestamp":1762813451000},"page":"105-131","source":"Crossref","is-referenced-by-count":1,"title":["Is more always better? Measuring the quality of ranking data through information entropy"],"prefix":"10.2478","volume":"11","author":[{"given":"Yishan","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Systems Science, Faculty of Arts and Sciences, Beijing Normal University , Zhuhai , , China"},{"name":"International Academic Center of Complex Systems, Beijing Normal University , Zhuhai , , China"},{"name":"School of Systems Science, Beijing Normal University , Beijing , , China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Xiao","sequence":"additional","affiliation":[{"name":"Department of Systems Science, Faculty of Arts and Sciences, Beijing Normal University , Zhuhai , , China"},{"name":"International Academic Center of Complex Systems, Beijing Normal University , Zhuhai , , China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Long","sequence":"additional","affiliation":[{"name":"College of Electronic Science and Technology, National University of Defense Technology , Changsha , , China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Systems Science, Faculty of Arts and Sciences, Beijing Normal University , Zhuhai , , China"},{"name":"International Academic Center of Complex Systems, Beijing Normal University , Zhuhai , , China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"374","published-online":{"date-parts":[[2025,11,7]]},"reference":[{"key":"2026020518361855727_j_jdis-2025-0055_ref_001","doi-asserted-by":"crossref","unstructured":"Adade, S. Y.-S. S., Lin, H., Johnson, N. A. N., Nunekpeku, X., Aheto, J. H., Ekumah, J.-N., Kwadzokpui, B. A., Teye, E., Ahmad, W., & Chen, Q. (2024). Advanced food contaminant detection through multi-source data fusion: Strategies, applications, and future perspectives. Trends in Food Science & Technology, 104851.","DOI":"10.1016\/j.tifs.2024.104851"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_002","doi-asserted-by":"crossref","unstructured":"Aledo, J. A., G\u00e1mez, J. A., & Molina, D. (2016). Using extension sets to aggregate partial rankings in a flexible setting. Applied Mathematics and Computation, 290, 208\u2013223. https:\/\/doi.org\/10.1016\/j.amc.2016.06.005","DOI":"10.1016\/j.amc.2016.06.005"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_003","doi-asserted-by":"crossref","unstructured":"Ali, A., & Meil\u0103, M. (2012). Experiments with kemeny ranking: What works when? Mathematical Social Sciences, 64(1), 28\u201340.","DOI":"10.1016\/j.mathsocsci.2011.08.008"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_004","doi-asserted-by":"crossref","unstructured":"Ali, I., Cook, W. D., & Kress, M. (1986). On the minimum violations ranking of a tournament. Management Science, 32(6), 660\u2013672.","DOI":"10.1287\/mnsc.32.6.660"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_005","doi-asserted-by":"crossref","unstructured":"Almog, A., & Shmueli, E. (2019). Structural Entropy: Monitoring Correlation-Based Networks Over Time With Application To Financial Markets. Scientific Reports, 9(1), 10832. https:\/\/doi.org\/10.1038\/s41598-019- 47210-8","DOI":"10.1038\/s41598-019-47210-8"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_006","doi-asserted-by":"crossref","unstructured":"Argentini, A., & Blanzieri, E. (2012). Ranking Aggregation Based on Belief Function. In S. Greco, B. Bouchon-Meunier, G. Coletti, M. Fedrizzi, B. Matarazzo, & R. R. Yager (Eds.), Advances in Computational Intelligence (Vol. 299, pp. 511\u2013520). Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-31718-7_53","DOI":"10.1007\/978-3-642-31718-7_53"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_007","doi-asserted-by":"crossref","unstructured":"Caplin, A., & Nalebuff, B. (1991). Aggregation and Social Choice: A Mean Voter Theorem. Econometrica, 59(1), 1. https:\/\/doi.org\/10.2307\/2938238","DOI":"10.2307\/2938238"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_008","unstructured":"Chartier, T. P., Kreutzer, E., Langville, A. N., Pedings, K., & Yamamoto, Y. (2010). Minimum violations sports ranking using evolutionary optimization and binary integer linear program approaches. In A. Bedford & M. Ovens (Eds.), Proceedings of the Tenth Australian Conference on Mathematics and Computers in Sport (pp. 13\u201320)."},{"key":"2026020518361855727_j_jdis-2025-0055_ref_009","doi-asserted-by":"crossref","unstructured":"Chen, K., Bui, T., Chen, F., Wang, Z., & Nevatia, R. (2017). AMC: Attention guided Multi-modal Correlation Learning for Image Search (Version 1). arXiv. https:\/\/doi.org\/10.48550\/ARXIV.1704.00763","DOI":"10.1109\/CVPR.2017.657"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_010","doi-asserted-by":"crossref","unstructured":"Chen, X., Li, W., Lu, S., Zhou, Z., & Fu, X. (2018). Efficient resource allocation for on-demand mobile-edge cloud computing. IEEE Transactions on Vehicular Technology, 67(9), 8769\u20138780.","DOI":"10.1109\/TVT.2018.2846232"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_011","unstructured":"de Borda, J. (1781). M\u2019emoire sur les\u2019 elections au scrutin. Histoire de l\u2019Acad\u2019emie Royale Des Sciences, 102, 657-665."},{"key":"2026020518361855727_j_jdis-2025-0055_ref_012","unstructured":"de Caritat Mis, J. A. N. (1785). Essai sur I\u2019application de I\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. Imprimerie royale."},{"key":"2026020518361855727_j_jdis-2025-0055_ref_013","doi-asserted-by":"crossref","unstructured":"Dehmer, M., & Mowshowitz, A. (2011). A history of graph entropy measures. Information Sciences, 181(1), 57-78. https:\/\/doi.org\/10.1016\/j.ins.2010.08.041","DOI":"10.1016\/j.ins.2010.08.041"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_014","doi-asserted-by":"crossref","unstructured":"Deng, K., Han, S., Li, K. J., & Liu, J. S. (2014). Bayesian aggregation of order-based rank data. Journal of the American Statistical Association, 109(507), 1023\u20131039.","DOI":"10.1080\/01621459.2013.878660"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_015","doi-asserted-by":"crossref","unstructured":"Dourado, I. C., Pedronette, D. C. G., & Torres, R. da S. (2019). Unsupervised graph-based rank aggregation for improved retrieval. Information Processing & Management, 56(4), 1260\u20131279. https:\/\/doi.org\/10.1016\/j. ipm.2019.03.008","DOI":"10.1016\/j.ipm.2019.03.008"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_016","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the Web. In Proceedings of the 10th International Conference on World Wide Web (pp.613\u2013622). Association for Computing Machinery. https:\/\/doi.org\/10.1145\/371920.372165","DOI":"10.1145\/371920.372165"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_017","doi-asserted-by":"crossref","unstructured":"Faghri, A., & Bergman, T. L. (2024). Ranking academic institutions based on the productivity, impact, and quality of institutional scholars. Journal of Data and Information Science, 9(3), 116\u2013154. https:\/\/doi.org\/10.2478\/jdis-2024-0017","DOI":"10.2478\/jdis-2024-0017"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_018","doi-asserted-by":"crossref","unstructured":"Frank Hsu, D., & Taksa, I. (2005). Comparing rank and score combination methods for data fusion in information retrieval. Information Retrieval, 8(3), 449\u2013480.","DOI":"10.1007\/s10791-005-6994-4"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_019","doi-asserted-by":"crossref","unstructured":"Guo, X., Chen, Y., Du, J., & Dong, E. (2022). Extracting and Measuring Uncertain Biomedical Knowledge from Scientific Statements. Journal of Data and Information Science, 7(2), 6\u201330. https:\/\/doi.org\/10.2478\/jdis-2022-0008","DOI":"10.2478\/jdis-2022-0008"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_020","doi-asserted-by":"crossref","unstructured":"Hartley, R. V. (1928). Transmission of information 1. Bell System Technical Journal, 7(3), 535\u2013563.","DOI":"10.1002\/j.1538-7305.1928.tb01236.x"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_021","doi-asserted-by":"crossref","unstructured":"Hong, Y., Zhang, M., & Meeker, W. Q. (2018). Big data and reliability applications: The complexity dimension. Journal of Quality Technology, 50(2), 135\u2013149.","DOI":"10.1080\/00224065.2018.1438007"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_022","doi-asserted-by":"crossref","unstructured":"Kayed, A., El-Qawasmeh, E., & Qawaqneh, Z. (2010). Ranking web sites using domain ontology concepts. Information & Management, 47(7\u20138), 350\u2013355.","DOI":"10.1016\/j.im.2010.08.002"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_023","doi-asserted-by":"crossref","unstructured":"Kendall, M. G. (1938). A new measure of rank correlation. Biometrika, 30(1\u20132), 81\u201393.","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_024","doi-asserted-by":"crossref","unstructured":"Kendall, M. G. (1945). The treatment of ties in ranking problems. Biometrika, 33(3), 239\u2013251.","DOI":"10.1093\/biomet\/33.3.239"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_025","doi-asserted-by":"crossref","unstructured":"Keyhanipour, A. H. (2025). Graph-induced rank-aggregation using information fusion operators. The Journal of Supercomputing, 81(1), 43. https:\/\/doi.org\/10.1007\/s11227-024-06595-8","DOI":"10.1007\/s11227-024-06595-8"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_026","doi-asserted-by":"crossref","unstructured":"Li, G., Gao, W., & Gao, W. (2024). Entropy coding. In Point Cloud Compression: Technologies and Standardization (pp. 113\u2013133). Springer.","DOI":"10.1007\/978-981-97-1957-0_6"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_027","doi-asserted-by":"crossref","unstructured":"Li, X., Wang, X., & Xiao, G. (2019). A comparative study of rank aggregation methods for partial and top ranked lists in genomic applications. Briefings in Bioinformatics, 20(1), 178\u2013189. https:\/\/doi.org\/10.1093\/bib\/bbx101","DOI":"10.1093\/bib\/bbx101"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_028","doi-asserted-by":"crossref","unstructured":"Lillis, D. (2020). On the evaluation of data fusion for information retrieval. In Proceedings of the 12th Annual Meeting of the Forum for Information Retrieval Evaluation (pp. 54\u201357).","DOI":"10.1145\/3441501.3441506"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_029","doi-asserted-by":"crossref","unstructured":"Lin, S. (2010). Rank aggregation methods. Wiley Interdisciplinary Reviews: Computational Statistics, 2(5), 555\u2013570.","DOI":"10.1002\/wics.111"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_030","doi-asserted-by":"crossref","unstructured":"Liu, X., Wang, X., Lyu, L., & Wang, Y. (2022). Identifying disruptive technologies by integrating multi-source data. Scientometrics, 127(9), 5325\u20135351.","DOI":"10.1007\/s11192-022-04283-z"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_031","unstructured":"Luce, R. D. (1959). Individual choice behavior (Vol. 4). Wiley New York."},{"key":"2026020518361855727_j_jdis-2025-0055_ref_032","doi-asserted-by":"crossref","unstructured":"Lynch, C., Aryafar, K., & Attenberg, J. (2016). Images Don\u2019t Lie: Transferring Deep Visual Semantic Features to Large-Scale Multimodal Learning to Rank. In Proceedings of the 22nd ACM SIGKDD International Conference on KnowledgeDiscovery andDataMining (pp. 541\u2013548). https:\/\/doi.org\/10.1145\/2939672.2939728","DOI":"10.1145\/2939672.2939728"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_033","doi-asserted-by":"crossref","unstructured":"Maanijou, R., & Mirroshandel, S. A. (2019). Introducing an expert system for prediction of soccer player ranking using ensemble learning. Neural Computing and Applications, 31(12), 9157\u20139174.","DOI":"10.1007\/s00521-019-04036-9"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_034","doi-asserted-by":"crossref","unstructured":"Mallows, C. L. (1957). Non-null ranking models. I. Biometrika, 44(1\/2), 114\u2013130.","DOI":"10.1093\/biomet\/44.1-2.114"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_035","doi-asserted-by":"crossref","unstructured":"Neveling, M., & Rothe, J. (2021). Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. Artificial Intelligence, 298, 103508. https:\/\/doi.org\/10.1016\/j. artint.2021.103508","DOI":"10.1016\/j.artint.2021.103508"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_036","doi-asserted-by":"crossref","unstructured":"Omar, Y. M., & Plapper, P. (2020). A Survey of Information Entropy Metrics for Complex Networks. Entropy, 22(12), 1417. https:\/\/doi.org\/10.3390\/e22121417","DOI":"10.3390\/e22121417"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_037","doi-asserted-by":"crossref","unstructured":"Ossadnik, W., Schinke, S., & Kaspar, R. H. (2016). Group aggregation techniques for analytic hierarchy process and analytic network process: A comparative analysis. Group Decision and Negotiation, 25(2), 421\u2013457.","DOI":"10.1007\/s10726-015-9448-4"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_038","doi-asserted-by":"crossref","unstructured":"Pedings, K. E., Langville, A. N., & Yamamoto, Y. (2012). A minimum violations ranking method. Optimization and Engineering, 13(2), 349\u2013370. https:\/\/doi.org\/10.1007\/s11081-011-9135-5","DOI":"10.1007\/s11081-011-9135-5"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_039","doi-asserted-by":"crossref","unstructured":"Plackett, R. L. (1975). The analysis of permutations. Journal of the Royal Statistical Society Series C: Applied Statistics, 24(2), 193\u2013202.","DOI":"10.2307\/2346567"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_040","doi-asserted-by":"crossref","unstructured":"Pujahari, A., & Sisodia, D. S. (2020). Aggregation of preference relations to enhance the ranking quality of collaborative filtering based group recommender system. Expert Systems with Applications, 156, 113476. https:\/\/doi.org\/10.1016\/j.eswa.2020.113476","DOI":"10.1016\/j.eswa.2020.113476"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_041","unstructured":"Qin, T., Geng, X., & Liu, T.-Y. (2010). A new probabilistic model for rank aggregation. In Proceedings of the 24th International Conference on Neural Information Processing Systems (pp. 1948\u20131956). Curran Associates Inc."},{"key":"2026020518361855727_j_jdis-2025-0055_ref_042","doi-asserted-by":"crossref","unstructured":"Reilly, B. (2002). Social Choice in the South Seas: Electoral Innovation and the Borda Count in the Pacific Island Countries.InternationalPoliticalScienceReview,23(4), 355\u2013372.https:\/\/doi.org\/10.1177\/0192512102023004002","DOI":"10.1177\/0192512102023004002"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_043","unstructured":"Rong, C., Wen, Z. H. U., & Jiqing, S. U. N. (2019). Multi-source data fusion method and its empirical study for journal evaluation. Chinese Journal of Scientific and Technical Periodicals, 30(6), 685."},{"key":"2026020518361855727_j_jdis-2025-0055_ref_044","doi-asserted-by":"crossref","unstructured":"Schalekamp, F., & Zuylen, A. van. (2009). Rank aggregation: Together we\u2019re strong. In 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 38\u201351).","DOI":"10.1137\/1.9781611972894.4"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_045","doi-asserted-by":"crossref","unstructured":"Shannon, C. E. (1948). A mathematical theory of communication. The Bell System Technical Journal, 27(3), 379\u2013423.","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_046","doi-asserted-by":"crossref","unstructured":"Soneson, C., & Robinson, M. D. (2018). Bias, robustness and scalability in single-cell differential expression analysis. Nature Methods, 15(4), 255\u2013261.","DOI":"10.1038\/nmeth.4612"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_047","doi-asserted-by":"crossref","unstructured":"Spearman, C. (1987). The proof and measurement of association between two things. The American Journal of Psychology, 100(3\/4), 441\u2013471.","DOI":"10.2307\/1422689"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_048","doi-asserted-by":"crossref","unstructured":"Tadbier, A. W., & Shoufan, A. (2021). Ranking educational channels on YouTube: Aspects and issues. Education and Information Technologies, 26(3), 3077\u20133096. https:\/\/doi.org\/10.1007\/s10639-020-10414-x","DOI":"10.1007\/s10639-020-10414-x"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_049","doi-asserted-by":"crossref","unstructured":"Tian, Y., Zhang, Z., Xiong, J., Chen, L., Ma, J., & Peng, C. (2022). Achieving Graph Clustering Privacy Preservation Based on Structure Entropy in Social IoT. IEEE Internet of Things Journal, 9(4), 2761\u20132777. https:\/\/doi. org\/10.1109\/JIOT.2021.3092185","DOI":"10.1109\/JIOT.2021.3092185"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_050","doi-asserted-by":"crossref","unstructured":"Ursu, R. M. (2015). The power of rankings: Quantifying the effects of rankings on online consumer search and choice. SSRN Electronic Journal. https:\/\/dx.doi.org\/10.2139\/ssrn.2729325","DOI":"10.2139\/ssrn.2729325"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_051","doi-asserted-by":"crossref","unstructured":"Wang, J.-N., Du, J., & Chiu, Y.-L. (2020). Can online user reviews be more helpful? Evaluating and improving ranking approaches. Information & Management, 57(8), 103281.","DOI":"10.1016\/j.im.2020.103281"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_052","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, Y., Yang, J., Jia, X., Li, L., Ding, W., & Wang, F.-Y. (2024). The survey on multi-source data fusion in cyber-physical-social systems: Foundational infrastructure for industrial metaverses and industries 5.0. Information Fusion, 107, 102321.","DOI":"10.1016\/j.inffus.2024.102321"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_053","unstructured":"Wimmer, L., Sale, Y., Hofman, P., Bischl, B., & H\u00fcllermeier, E. (2023). Quantifying aleatoric and epistemic uncertainty in machine learning: Are conditional entropy and mutual information appropriate measures? Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI 2023), Proceedings of Machine Learning Research, 216, 2282\u20132292. Retrieved from https:\/\/proceedings.mlr.press\/v216\/wimmer23a.html"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_054","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Deng, H.-Z., Lu, X., & Wu, J. (2021). Graph-based rank aggregation method for high-dimensional and partial rankings. Journal of the Operational Research Society, 72(1), 227\u2013236. https:\/\/doi.org\/10.1080\/0160 5682.2019.1657365","DOI":"10.1080\/01605682.2019.1657365"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_055","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Deng, Y., Wu, J., Deng, H.-Z., & Lu, X. (2017). Comparison of rank aggregation methods based on inherent ability. Naval Research Logistics, 64(7), 556\u2013565.","DOI":"10.1002\/nav.21771"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_056","doi-asserted-by":"crossref","unstructured":"Xu, H., Luo, R., Winnink, J., Wang, C., & Elahi, E. (2022). A methodology for identifying breakthrough topics using structural entropy. Information Processing & Management, 59(2), 102862. https:\/\/doi.org\/10.1016\/j.ipm.2021.102862","DOI":"10.1016\/j.ipm.2021.102862"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_057","doi-asserted-by":"crossref","unstructured":"Xu, H.-Y., Yue, Z.-H., Wang, C., Dong, K., Pang, H.-S., & Han, Z. (2017). Multi-source data fusion study in scientometrics. Scientometrics, 111(2), 773\u2013792.","DOI":"10.1007\/s11192-017-2290-5"},{"key":"2026020518361855727_j_jdis-2025-0055_ref_058","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Shi, Z., Zhang, J., Chen, D., & Gu, L. (2019). A novel active learning framework for classification: Using weighted rank aggregation to achieve multiple query criteria. Pattern Recognition, 93, 581\u2013602.","DOI":"10.1016\/j.patcog.2019.03.029"}],"container-title":["Journal of Data and Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.2478\/jdis-2025-0055\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.2478\/jdis-2025-0055\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T18:37:49Z","timestamp":1770316669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.2478\/jdis-2025-0055\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,7]]},"references-count":58,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12,28]]},"published-print":{"date-parts":[[2026,2,1]]}},"alternative-id":["10.2478\/jdis-2025-0055"],"URL":"https:\/\/doi.org\/10.2478\/jdis-2025-0055","relation":{},"ISSN":["2543-683X"],"issn-type":[{"value":"2543-683X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,7]]}}}