Possibilistic contextual skylines with incomplete preferences

Hadjali, Allel; Pivert, Olivier; Prade, Henri

doi:10.1109/socpar.2010.5686427

Cited by 15 publications

(4 citation statements)

References 16 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, FDS query selects and discriminates tuples that are actually not dominated, but also tuples that are near to be not dominated. See also [30] for further discussions. Lastly, all efforts made on this topic, focus only on numerical domains with inherent orders, and do not consider skyline queries over categorical domains (if we except the work done in [36]).…”

Section: Databases Approaches To Preference Handling In Queryingmentioning

confidence: 99%

Database preference queries—a possibilistic logic approach with symbolic priorities

Hadjali

Kaci

Prade

2011

Ann Math Artif Intell

View full text Add to dashboard Cite

The paper presents a new approach to database preference queries, where preferences are represented in a possibilistic logic manner, using symbolic weights. The symbolic weights may be processed without assessing their precise value, which leaves the freedom for the user to not specify any priority among the preferences. The user may also enforce a (partial) ordering between them, if necessary. The approach can be related to the processing of fuzzy queries whose components are conditionally weighted in terms of importance. In this paper, importance levels are symbolically processed, and refinements of both Pareto ordering and minimum ordering are used. The representational power of the proposed setting is stressed, while the approach is compared with database Best operator-like methods and with the CP-net approach developed in artificial intelligence. The paper also provides a structured and rather broad overview of the different lines of research in the literature dealing with the handling of preferences in database queries.

show abstract

Section: Databases Approaches To Preference Handling In Queryingmentioning

confidence: 99%

Database preference queries—a possibilistic logic approach with symbolic priorities

Hadjali

Kaci

Prade

2011

Ann Math Artif Intell

View full text Add to dashboard Cite

show abstract

“…Very recently, uncertain contextual preferences have been addressed in 29,30 in the skyline queries setting * * . Namely, how to deal with the problem of missing information in users preferences (i.e., preferences are not specified for some specific context).…”

Section: Related Workmentioning

confidence: 99%

A Fuzzy-Rule-Based Model for Handling Contextual Preference Queries

Hadjali¹,

Mokhtari²,

Pivert³

2012

IJCIS

View full text Add to dashboard Cite

Users' preferences have traditionally been exploited in query personalization to better serve their information needs. Most of the time, user preferences depend on context, that is, they may have different values depending on the situation of the user. In this paper, we propose a fuzzy-rule-based model for the representation of contextual preferences in a database querying framework. We discuss the augmentation of a query with preferences deduced from information regarding the current context of the user. To this end, we make use of an appropriate inference pattern, called generalized modus ponens, able to deal with data and knowledge when they are described in a fuzzy way.

show abstract

“…They have received a lot of attention over the recent years. Several research efforts have been made to develop efficient algorithms and to introduce different variants for skyline queries [18], [19], [20], [21]. Up to our knowledge, no work related to skyline queries exists in a graph data context, except the recent work by Zou et al [22] where dynamic skyline queries in a large graph have been studied.…”

Section: Related Workmentioning

confidence: 99%

A similarity skyline approach for handling graph queries - A preliminary report

Abbaci

Hadjali

Liétard

et al. 2011

2011 IEEE 27th International Conference on Data Engineering Workshops

View full text Add to dashboard Cite

Abstract-One of the fundamental problems in graph databases is similarity search for graphs of interest. Existing approaches dealing with this problem rely on a single similarity measure between graph structures. In this paper, we suggest an alternative approach allowing for searching similar graphs to a graph query where similarity between graphs is rather modeled by a vector of scalars than a unique scalar. To this end, we introduce the notion of similarity skyline of a graph query defined by the subset of graphs of the target database that are the most similar to the query in a Pareto sense. The idea is to achieve a d-dimensional comparison between graphs in terms of local distance (or similarity) measures and to retrieve those graphs that are maximally similar in the sense of the Pareto dominance relation. A diversity-based method for refining the retrieval result is proposed as well.

show abstract

Possibilistic contextual skylines with incomplete preferences

Cited by 15 publications

References 16 publications

Database preference queries—a possibilistic logic approach with symbolic priorities

Database preference queries—a possibilistic logic approach with symbolic priorities

A Fuzzy-Rule-Based Model for Handling Contextual Preference Queries

A similarity skyline approach for handling graph queries - A preliminary report

Contact Info

Product

Resources

About