Profiling Sets for Preference Querying
SEBD(2009)
摘要
We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set pref- erences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the "best" sets.
更多查看译文
关键词
heuristic algorithm,logical framework
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络