arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.3899cs.AI
收藏

组合系统的定性偏好表示与推理

Representing and Reasoning with Qualitative Preferences for Compositional Systems

Iowa State University(爱荷华州立大学)

Ganesh Ram Santhanam, Samik Basu, Vasant Honavar

摘要:

许多应用,例如,Web服务组合、复杂系统设计、团队组建等,依赖于用于标识满足某些功能要求的对象或实体的集合的方法。在满足功能需求的集合中,通常需要识别一个或多个集合,这些集合相对于描述集合的非功能属性的一组属性的用户偏好是最佳的。我们开发了一种形式主义,让用户表达属性之间的相对重要性和定性偏好的估值,每个属性。我们定义了一个优势关系,使我们能够比较对象的集合的属性,使集合的对象的偏好。我们建立了优势关系的一些关键性质。特别地,当属性内偏好关系为严格偏序,相对重要性偏好关系为区间序时,证明了优势关系为严格偏序.我们提供的算法,使用这种优势关系,以确定最首选的集合。我们表明,在一定的条件下,算法保证返回只有(声音),所有(完整),或至少有一个(弱完整)的最首选的集合。我们目前的模拟实验结果比较所提出的算法(a)的质量的解决方案(最首选的解决方案的数量)所产生的算法,和(b)他们的性能和效率。我们还探讨了一些有趣的approachtures建议我们的实验结果,涉及用户的偏好,优势关系,和算法的属性。

英文摘要:

Many applications, e.g., Web service composition, complex system design, team formation, etc., rely on methods for identifying collections of objects or entities satisfying some functional requirement. Among the collections that satisfy the functional requirement, it is often necessary to identify one or more collections that are optimal with respect to user preferences over a set of attributes that describe the non-functional properties of the collection. We develop a formalism that lets users express the relative importance among attributes and qualitative preferences over the valuations of each attribute. We define a dominance relation that allows us to compare collections of objects in terms of preferences over attributes of the objects that make up the collection. We establish some key properties of the dominance relation. In particular, we show that the dominance relation is a strict partial order when the intra-attribute preference relations are strict partial orders and the relative importance preference relation is an interval order. We provide algorithms that use this dominance relation to identify the set of most preferred collections. We show that under certain conditions, the algorithms are guaranteed to return only (sound), all (complete), or at least one (weakly complete) of the most preferred collections. We present results of simulation experiments comparing the proposed algorithms with respect to (a) the quality of solutions (number of most preferred solutions) produced by the algorithms, and (b) their performance and efficiency. We also explore some interesting conjectures suggested by the results of our experiments that relate the properties of the user preferences, the dominance relation, and the algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑