Access the full text.
Sign up today, get DeepDyve free for 14 days.
N. Liu, Qiang Yang (2008)
EigenRank: a ranking-oriented approach to collaborative filtering
[ (2020)
Trice-valued fuzzy sets: Mathematical model for three-way decisionsInf. Sci. 507 (2020), 574–584. Retrieved from 10.1016/j.ins.2018.09.007., 507
W. Hines (2003)
Probability and Statistics in Engineering
[ (2018)
Collective semantic behavior extraction in social networksJ. Comput. Science 28 (2018), 236–244. Retrieved from 10.1016/j.jocs.2017.11.003., 28
Huanhuan Chen, P. Tiňo, X. Yao (2009)
Probabilistic Classification Vector MachinesIEEE Transactions on Neural Networks, 20
[ (2020)
Weighted partial order oriented three-way decisions under score-based common voting rulesInt. J. Approx. Reason. 123 (2020), 41–54. Retrieved from 10.1016/j.ijar.2020.05.006., 123
Lirong Xia (2019)
Learning and Decision-Making from Rank DataSynthesis Lectures on Artificial Intelligence and Machine Learning
Yiyu Yao (2009)
Three-Way Decision: An Interpretation of Rules in Rough Set Theory
Huanhuan Chen, P. Tiňo, X. Yao (2009)
Predictive Ensemble Pruning by Expectation PropagationIEEE Transactions on Knowledge and Data Engineering, 21
Ao Liu, Qiong Wu, Zhenming Liu, Lirong Xia (2019)
Near-Neighbor Methods in Random Preference Completion
[ (2011)
A comprehensive survey of neighborhood-based recommendation methodsIn Recommender Systems Handbook. Springer US, Boston, MA, 107–144. Retrieved from 10.1007/978-0-387-85820-3_4.
[ (2015)
Context-aware reviewer assignment for trust enhanced peer reviewPLoS One 10, 6 (2015), e0130493, Retrieved from 10.1371/journal.pone.0130493., 10
[ (2019)
Near-neighbor methods in random preference completionIn AAAI Conference on Artificial Intelligence. 4336–4343. Retrieved from 10.1609/aaai.v33i01.33014336.
[ (2009)
Three-way decision: An interpretation of rules in rough set theoryIn 4th International Conference on Rough Sets and Knowledge Technology. 642–649. Retrieved from 10.1007/978-3-642-02962-2_81.
Lei Li, Yan Wang (2010)
Subjective Trust Inference in Composite ServicesProceedings of the AAAI Conference on Artificial Intelligence
Vincent Conitzer, Andrew Davenport, J. Kalagnanam (2006)
Improved Bounds for Computing Kemeny Rankings
Lei Li, Xindong Wu, Huanhuan Chen, Chuan Zhou, Guanfeng Liu, Yongkang Jiang (2020)
Weighted partial order oriented three-way decisions under score-based common voting rulesInt. J. Approx. Reason., 123
W. Marsden (2012)
I and J
[ (2019)
Learning and Decision-making from Rank DataMorgan & Claypool Publishers.
[ (2008)
EigenRank: A ranking-oriented approach to collaborative filteringIn 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 83–90. Retrieved from 10.1145/1390334.1390351.
[ (2017)
Exploiting collective knowledge with three-way decision theory: Cases from the questionnaire-based researchInt. J. Approx. Reason. 83 (2007), 356–370. Retrieved from 10.1016/j.ijar.2016.11.013., 83
(2008)
Bayesian Reliability
F. Cabitza, D. Ciucci, Angela Locoro (2017)
Exploiting collective knowledge with three-way decision theory: Cases from the questionnaire-based researchInt. J. Approx. Reason., 83
A. Jøsang (1998)
A Subjective Metric of Authentication
[ (2009)
Probabilistic classification vector machinesIEEE Trans. Neural Netw. 20, 6 (2009), 901–914. Retrieved from 10.1109/TNN.2009.2014161., 20
Christian Desrosiers, G. Karypis (2011)
A Comprehensive Survey of Neighborhood-based Recommendation Methods
Abhinandan Das, Mayur Datar, A. Garg, S. Rajaram (2007)
Google news personalization: scalable online collaborative filtering
[ (2009)
Predictive ensemble pruning by expectation propagationIEEE Trans. Knowl. Data Eng. 21, 7 (2009), 999–1013. Retrieved from 10.1109/TKDE.2009.62., 21
Lei Li, Yan Wang, Guanfeng Liu, M. Wang, Xindong Wu, Long Wang (2015)
Context-Aware Reviewer Assignment for Trust Enhanced Peer ReviewPLoS ONE, 10
O. Castro-Orgaz, W. Hager (2019)
and sShallow Water Hydraulics
Tyler Lu, Craig Boutilier (2011)
Learning Mallows Models with Pairwise Preferences
W. Gaertner (2006)
A Primer in Social Choice Theory
[ (2010)
Subjective trust inference in composite servicesIn AAAI Conference on Artificial Intelligence. 1377–1384. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/7504.
K. Horiuchi, B. Seselja, A. Tepavčević (2020)
Trice-valued fuzzy sets: Mathematical model for three-way decisionsInf. Sci., 507
Lei Li, Chuan Zhou, Jianping He, Jiamiao Wang, Xin Li, Xindong Wu (2017)
Collective semantic behavior extraction in social networksJ. Comput. Sci., 28
Lei Li, Minghe Xue, Zan Zhang, Huanhuan Chen, Xindong Wu (2022)
Certainty-based Preference CompletionData Intelligence, 4
[ (2007)
Google news personalization: Scalable online collaborative filteringIn 16th International Conference on World Wide Web. 271–280. Retrieved from 10.1145/1242572.1242610.
[ (2022)
Certainty-based preference completionData Intell. 4, 1 (2022), 112–133. Retrieved from 10.1162/dint_a_00115., 4
Alexander Rovira, Nicolas Müller, Weiwen Deng, Chudi Ndubaku, Richmond Sarpong (2019)
Bio-inspired synthesis of xishacorenes A, B, and C, and a new congener from fuscol† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c9sc02572cChemical Science, 10
Julian Katz-Samuels, Clayton Scott (2017)
Nonparametric Preference Completion
With the personal partial rankings from agents over a subset of alternatives, the goal of preference completion is to infer the agent’s personalized preference over all alternatives including those the agent has not yet handled from uncertain preference of third parties. By combining the partial rankings of the target agent and the partial rankings from third parties to settle some disagreement with three-way preference completion, which includes a general strategy, an optimal strategy, and a pessimistic strategy, it forms the weighted preference graph. Technically, to settle the disagreement and obtain the completed preference of the target agent in the weighted preference graph, maximum likelihood estimation (MLE) under Mallows is proposed and validated theoretically by removing edges with the minimum weight in the weighted preference graph. However, it is not easy to locate the edges with the minimum weight efficiently in a big graph. Hence, an optimal MLE algorithm and three greedy MLE algorithms are proposed to process the MLE. Furthermore, these proposed algorithms are experimentally validated and compared with each other by both the synthetic dataset and the Flixter dataset.
ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery
Published: Mar 1, 2023
Keywords: Preference completion
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.