Profiling sets for preference querying

Xi Zhang; Jan Chomicki

Profiling sets for preference querying

Xi Zhang
, Jan Chomicki

Department of Computer Science and Engineering

SUNY Buffalo

Research output: Contribution to conference › Paper › peer-review

Abstract

We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the "best" sets.

Original language	English
Pages	34-44
Number of pages	11
State	Published - 2008
Event	16th Italian Symposium on Advanced Database Systems, SEBD 2008 - Mondello, Palermo, Italy Duration: Jun 22 2008 → Jun 25 2008

Conference

Conference	16th Italian Symposium on Advanced Database Systems, SEBD 2008
Country/Territory	Italy
City	Mondello, Palermo
Period	06/22/08 → 06/25/08

Cite this

@conference{13b7d8fcc442460eb5685def42857397,

title = "Profiling sets for preference querying",

abstract = "We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the {"}best{"} sets.",

author = "Xi Zhang and Jan Chomicki",

year = "2008",

language = "English",

pages = "34--44",

note = "16th Italian Symposium on Advanced Database Systems, SEBD 2008 ; Conference date: 22-06-2008 Through 25-06-2008",

}

TY - CONF

T1 - Profiling sets for preference querying

AU - Zhang, Xi

AU - Chomicki, Jan

PY - 2008

Y1 - 2008

N2 - We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the "best" sets.

AB - We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the "best" sets.

UR - https://www.scopus.com/pages/publications/84893238093

M3 - Paper

AN - SCOPUS:84893238093

SP - 34

EP - 44

T2 - 16th Italian Symposium on Advanced Database Systems, SEBD 2008

Y2 - 22 June 2008 through 25 June 2008

ER -

Profiling sets for preference querying

Abstract

Conference

Other files and links

Fingerprint

Cite this