.png){kind=icon}
.png){kind=icon}
Return
Three-way Preference Completion via Preference Graph
.png){kind=icon}
PRE
AI
DOI：10.1145/3580368.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the personal partial rankings fromagents 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.
Keywords:
Preference completion
preference graph
three-way decision
maximum
likelihood estimation
Journal
IF:
4.8
Papers:
1.3K
Citations:
4.4K