基于成对比较的众包Pareto最优目标发现
Crowdsourcing Pareto-Optimal Object Finding by Pairwise Comparisons
摘要:
这是第一个研究众包帕累托最优对象发现,它在公众意见收集,群体决策和信息探索的应用。从以前的研究众包天际线和排名查询,它认为对象没有明确的属性和对象的偏好关系是严格的偏序的情况下。通过聚集众包者对成对比较问题的响应来导出偏序。目标是通过尽可能少的问题找到所有帕累托最优对象。它采用了一个迭代的问题选择框架。该框架遵循急切识别非帕累托最优对象的原则,只选择满足三个条件的候选问题。这种设计是充分和有效的,因为它被证明可以找到一个短的终端问题序列。该框架进一步由两个思想-宏观有序和微观有序。通过不同的微排序算法,该框架被实例化为几个不同的权力修剪问题的算法。使用真实的众包市场和模拟的实验结果显示,与蛮力方法相比,不仅问题数量级减少,而且从最有效的实例化中获得了接近最佳的性能。
英文摘要:
This is the first study on crowdsourcing Pareto-optimal object finding, which has applications in public opinion collection, group decision making, and information exploration. Departing from prior studies on crowdsourcing skyline and ranking queries, it considers the case where objects do not have explicit attributes and preference relations on objects are strict partial orders. The partial orders are derived by aggregating crowdsourcers' responses to pairwise comparison questions. The goal is to find all Pareto-optimal objects by the fewest possible questions. It employs an iterative question-selection framework. Guided by the principle of eagerly identifying non-Pareto optimal objects, the framework only chooses candidate questions which must satisfy three conditions. This design is both sufficient and efficient, as it is proven to find a short terminal question sequence. The framework is further steered by two ideas---macro-ordering and micro-ordering. By different micro-ordering heuristics, the framework is instantiated into several algorithms with varying power in pruning questions. Experiment results using both real crowdsourcing marketplace and simulations exhibited not only orders of magnitude reductions in questions when compared with a brute-force approach, but also close-to-optimal performance from the most efficient instantiation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。