Add to ORKGThe paper proposes to extend the classical relational data model by the notion of preference realized through a partial ordering on the set of relation instances. The extension involves not only data representation but also data manipulation
One of the key tasks in data mining and information retrieval is to learn preference relations betwe...
AbstractThe relational model is formally extended to include fixed orderings on attribute domains. A...
Abstract. One of the key tasks in data mining and information retrieval is to learn preference relat...
The aim of the paper is to present a novel, general approach to preference modelling in the framewor...
There is a need for handling preferences in relational query languages that arises naturally in real...
Abstract. The paper gives an overview of recent advances in the field of logic of preference and dis...
AbstractValue functions are defined over a fixed set of outcomes. In work on preference handling in ...
This chapter provides the reader with a presentation of preference modelling fundamental notions as ...
The notion of user preference in database modeling has recently received much attention in advanced ...
The design and implementation of advanced personalized database applications requires a preference-d...
This paper offers an overview of the literature on preference modelling. Our departure point is the ...
A key task in data mining and information retrieval is learning preference relations. Most of method...
Personalization of e-services poses new challenges to database technology. In particular, a powerful...
Preference relations are intensively studied in Economics, but they are also approached in AI, Know...
We extend the relational data model to incorporate partial orderings into data domains, which we cal...
One of the key tasks in data mining and information retrieval is to learn preference relations betwe...
AbstractThe relational model is formally extended to include fixed orderings on attribute domains. A...
Abstract. One of the key tasks in data mining and information retrieval is to learn preference relat...
The aim of the paper is to present a novel, general approach to preference modelling in the framewor...
There is a need for handling preferences in relational query languages that arises naturally in real...
Abstract. The paper gives an overview of recent advances in the field of logic of preference and dis...
AbstractValue functions are defined over a fixed set of outcomes. In work on preference handling in ...
This chapter provides the reader with a presentation of preference modelling fundamental notions as ...
The notion of user preference in database modeling has recently received much attention in advanced ...
The design and implementation of advanced personalized database applications requires a preference-d...
This paper offers an overview of the literature on preference modelling. Our departure point is the ...
A key task in data mining and information retrieval is learning preference relations. Most of method...
Personalization of e-services poses new challenges to database technology. In particular, a powerful...
Preference relations are intensively studied in Economics, but they are also approached in AI, Know...
We extend the relational data model to incorporate partial orderings into data domains, which we cal...
One of the key tasks in data mining and information retrieval is to learn preference relations betwe...
AbstractThe relational model is formally extended to include fixed orderings on attribute domains. A...
Abstract. One of the key tasks in data mining and information retrieval is to learn preference relat...