作者: Patrick Bosc , Olivier Pivert , Gregory Smits
DOI: 10.1007/978-3-642-04957-6_1
关键词:
摘要: This article presents an approach to database flexible queries which relies on the notion of outranking and a classification process. Instead being compared pairwise like in Pareto-order-based approaches, tuples are acceptability profiles that associated with predefined classes. According their satisfaction user preferences, assigned classes certain degree. proposes algorithm linear complexity makes it possible aggregate non-commensurable preferences.