A Flexible Querying Approach Based on Outranking and Classification

Authors:
Patrick Bosc;Olivier Pivert;Gregory Smits
Affiliations:
Irisa --- Enssat, University of Rennes 1, Technopole Anticipa, Lannion Cedex, France 22305;Irisa --- Enssat, University of Rennes 1, Technopole Anticipa, Lannion Cedex, France 22305;Irisa --- Enssat, University of Rennes 1, Technopole Anticipa, Lannion Cedex, France 22305
Venue:
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Year:
2009

Citing 11
Cited 0

The use of fuzzy outranking relations in preference modelling

Fuzzy Sets and Systems - Special issue dedicated to Professor Claude Ponsard
Fuzzy queries in multimedia database systems

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Using fuzzy sets in flexible querying: why and how?

Flexible query answering systems
A framework for expressing and combining preferences

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
Preference formulas in relational queries

ACM Transactions on Database Systems (TODS)
Foundations of preferences in database systems

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Preference SQL: design, implementation, experiences

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Database preferences queries: a possibilistic logic approach with symbolic priorities

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
SQLf: a relational database language for fuzzy querying

IEEE Transactions on Fuzzy Systems

Quantified Score

Hi-index	0.00

Visualization

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.