Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

SEBD
2008

favoriteEmaildiscussreport

159views Database» more SEBD 2008»

Profiling Sets for Preference Querying

14 years 13 days ago

Profiling Sets for Preference Querying

Download www.cse.buffalo.edu

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.

Xi Zhang, Jan Chomicki

Real-time Traffic

Candidate Sets | Database | Logical Framework | SEBD 2008 | Set Preferences |

claim paper

Related Content

» Using Query Profiles for Clarification

» Learning Personalized Query Modifications

» Adding Context to Preferences

» Personalization of Queries based on User Preferences

» Facilitating Active Multidimensional Association Mining with User Preference Ontology

» Deriving ConceptBased User Profiles from Search Engine Logs

» The Role of User Profiles in ContextAware Query Processing for the Semantic Web

» Querying with Intrinsic Preferences

» Personalized Queries under a Generalized Preference Model

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SEBD
Authors	Xi Zhang, Jan Chomicki

Comments (0)