{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:17:35Z","timestamp":1750911455165,"version":"3.38.0"},"reference-count":28,"publisher":"China Science Publishing & Media Ltd.","issue":"1","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"vor","delay-in-days":19,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["direct.mit.edu"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>As from time to time it is impractical to ask agents to provide linear orders over all alternatives, for these partial rankings it is necessary to conduct preference completion. Specifically, the personalized preference of each agent over all the alternatives can be estimated with partial rankings from neighboring agents over subsets of alternatives. However, since the agents' rankings are nondeterministic, where they may provide rankings with noise, it is necessary and important to conduct the certainty-based preference completion. Hence, in this paper firstly, for alternative pairs with the obtained ranking set, a bijection has been built from the ranking space to the preference space, and the certainty and conflict of alternative pairs have been evaluated with a well-built statistical measurement Probability-Certainty Density Function on subjective probability, respectively. Then, a certainty-based voting algorithm based on certainty and conflict has been taken to conduct the certainty-based preference completion. Moreover, the properties of the proposed certainty and conflict have been studied empirically, and the proposed approach on certainty-based preference completion for partial rankings has been experimentally validated compared to state-of-arts approaches with several datasets.<\/jats:p>","DOI":"10.1162\/dint_a_00115","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T20:35:36Z","timestamp":1642710936000},"page":"112-133","update-policy":"https:\/\/doi.org\/10.1162\/mitpressjournals.corrections.policy","source":"Crossref","is-referenced-by-count":3,"title":["Certainty-based Preference Completion"],"prefix":"10.3724","volume":"4","author":[{"given":"Lei","family":"Li","sequence":"first","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology), Ministry of Education, Hefei 230009, China"},{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230009, China"}]},{"given":"Minghe","family":"Xue","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230009, China"}]},{"given":"Zan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230009, China"}]},{"given":"Huanhuan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China"}]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology), Ministry of Education, Hefei 230009, China"}]}],"member":"2026","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"issue":"2020","key":"2022020307030498400_ref1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ijar.2020.05.006","article-title":"Weighted partial order oriented three-way decisions under\n                        score-based common voting rules","volume":"123","author":"Li","year":"2020","journal-title":"International\n                        Journal of Approximate Reasoning"},{"key":"2022020307030498400_ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14267-3","volume-title":"Learning to rank for information retrieval","author":"Liu","year":"2011"},{"key":"2022020307030498400_ref3","first-page":"4981","volume-title":"Deep learning for community detection: Progress, challenges and\n                        opportunities","author":"Liu","year":"2020"},{"volume-title":"A comprehensive survey on community detection with deep\n                        learning","year":"2021","author":"Su","key":"2022020307030498400_ref4"},{"key":"2022020307030498400_ref5","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2021.3118815","volume-title":"A comprehensive survey on graph anomaly detection with deep\n                        learning","author":"Ma","year":"2021"},{"key":"2022020307030498400_ref6","first-page":"632","volume-title":"Nonparametric preference completion","author":"Katz-Samuels","year":"2018"},{"key":"2022020307030498400_ref7","first-page":"83","volume-title":"Eigenrank: A ranking-oriented approach to collaborative\n                        filtering","author":"Liu","year":"2008"},{"key":"2022020307030498400_ref8","first-page":"4336","volume-title":"Near-neighbor methods in random preference completion","author":"Liu","year":"2019"},{"key":"2022020307030498400_ref9","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ijar.2019.11.002","article-title":"Three-way granular computing, rough sets, and formal concept\n                        analysis","volume":"116","author":"Yao","year":"2020","journal-title":"International Journal of Approximate\n                        Reasoning"},{"key":"2022020307030498400_ref10","first-page":"122","volume-title":"Context based trust normalization in service-oriented\n                        environments","author":"Li","year":"2010"},{"volume-title":"Why we make mistakes","year":"2010","author":"Hallinan","key":"2022020307030498400_ref11"},{"volume-title":"Individual choice behavior: A theoretical analysis","year":"1959","author":"Luce","key":"2022020307030498400_ref12"},{"key":"2022020307030498400_ref13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2346567","article-title":"The analysis of permutations","volume":"24","author":"Plackett","year":"1975","journal-title":"Applied\n                        Statistics"},{"key":"2022020307030498400_ref14","first-page":"4328","volume-title":"Learning plackett-luce mixtures from partial preferences","author":"Liu","year":"2019"},{"key":"2022020307030498400_ref15","first-page":"329","volume-title":"A subjective metric of authentication","author":"J\u2298sang","year":"1998"},{"key":"2022020307030498400_ref16","first-page":"1377","volume-title":"Subjective trust inference in composite services","author":"Li","year":"2010"},{"issue":"4","key":"2022020307030498400_ref17","doi-asserted-by":"crossref","DOI":"10.1145\/1867713.1867715","article-title":"Evidence-based trust: A mathematical model geared for\n                        multiagent systems","volume":"5","author":"Wang","year":"2010","journal-title":"ACM Transactions on Autonomous\n                        and Adaptive Systems"},{"key":"2022020307030498400_ref18","first-page":"642","volume-title":"Three-way decision: An interpretation of rules in rough set\n                        theory","author":"Yao","year":"2009"},{"issue":"6","key":"2022020307030498400_ref19","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/TNN.2009.2014161","article-title":"Probabilistic classification vector machines","volume":"20","author":"Chen","year":"2009","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"7","key":"2022020307030498400_ref20","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1109\/TKDE.2009.62","article-title":"Predictive ensemble pruning by expectation\n                        propagation","volume":"21","author":"Chen","year":"2009","journal-title":"IEEE Transactions Knowledge Data\n                        Engineering"},{"key":"2022020307030498400_ref21","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77950-8","volume-title":"Bayesian reliability","author":"Hamada","year":"2008"},{"volume-title":"Probability and statistics in engineering","year":"2003","author":"Hines","key":"2022020307030498400_ref22"},{"issue":"2","key":"2022020307030498400_ref23","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TNNLS.2013.2275077","article-title":"Efficient probabilistic classification vector machine with\n                        incremental basis function selection","volume":"25","author":"Chen","year":"2014","journal-title":"IEEE\n                        Transactions on Neural Networks and Learning Systems"},{"issue":"12","key":"2022020307030498400_ref24","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1109\/TKDE.2017.2749574","article-title":"Scalable graph-based semi-supervised learning through sparse\n                        bayesian model","volume":"29","author":"Jiang","year":"2017","journal-title":"IEEE Transactions on Knowledge and\n                        Data Engineering"},{"key":"2022020307030498400_ref25","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","article-title":"Learning to order things","volume":"5","author":"Cohen","year":"1999","journal-title":"Journal of\n                        Artificial Intelligence Research"},{"issue":"12","key":"2022020307030498400_ref26","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/138859.138867","article-title":"Using collaborative filtering to weave an information\n                        tapestry","volume":"35","author":"Goldberg","year":"1992","journal-title":"Communications of the ACM"},{"issue":"3\/4","key":"2022020307030498400_ref27","doi-asserted-by":"crossref","first-page":"470","DOI":"10.2307\/2332878","article-title":"Tests for rank correlation coefficients. I","volume":"44","author":"Fieller","year":"1957","journal-title":"Biometrika,"},{"key":"2022020307030498400_ref28","first-page":"1009","volume-title":"Model-based oversampling for imbalanced sequence\n                        classification","author":"Gong","year":"2016"}],"container-title":["Data Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/direct.mit.edu\/dint\/article-pdf\/4\/1\/112\/1985064\/dint_a_00115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/direct.mit.edu\/dint\/article-pdf\/4\/1\/112\/1985064\/dint_a_00115.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T07:43:40Z","timestamp":1741938220000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.sciengine.com\/doi\/10.1162\/dint_a_00115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2,3]]}},"URL":"https:\/\/doi.org\/10.1162\/dint_a_00115","relation":{},"ISSN":["2641-435X"],"issn-type":[{"type":"electronic","value":"2641-435X"}],"subject":[],"published-other":{"date-parts":[[2022]]},"published":{"date-parts":[[2022]]}}}