A Flexible Querying Approach Based on Outranking and Classification

  • Patrick Bosc
  • Olivier Pivert
  • Gregory Smits
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5822)

Abstract

This article presents an approach to database flexible queries which relies on the notion of outranking and a classification process. Instead of being compared pairwise like in Pareto-order-based approaches, tuples are compared to acceptability profiles that are associated with predefined classes. According to their satisfaction of user preferences, tuples are assigned to classes with a certain degree. This approach proposes a classification algorithm with a linear complexity and makes it possible to aggregate non-commensurable preferences.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Patrick Bosc
    • 1
  • Olivier Pivert
    • 1
  • Gregory Smits
    • 1
  1. 1.Irisa – EnssatUniversity of Rennes 1, Technopole AnticipaLannion CedexFrance

Personalised recommendations