Sciweavers

777 search results - page 15 / 156
» Optimization of Relational Preference Queries
Sort
View
AAAI
2007
13 years 10 months ago
Kernel Regression with Order Preferences
We propose a novel kernel regression algorithm which takes into account order preferences on unlabeled data. Such preferences have the form that point x1 has a larger target value...
Xiaojin Zhu, Andrew B. Goldberg
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
EUSFLAT
2001
107views Fuzzy Logic» more  EUSFLAT 2001»
13 years 9 months ago
Introducing the aggregate "count" into flexible queries
Flexible querying aims at expressing preferences inside queries instead of strict requirements. We consider ordinary relational databases and flexible querying calling on fuzzy se...
Patrick Bosc, Ludovic Lietard
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
13 years 6 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
14 years 9 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...