Sciweavers

38 search results - page 5 / 8
» Contracting preference relations for database applications
Sort
View
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 8 months ago
Relational learning via latent social dimensions
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
Lei Tang, Huan Liu
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 8 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
IS
2007
13 years 7 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
DEBU
2002
81views more  DEBU 2002»
13 years 7 months ago
Profiling and Service Delivery in Internet-enabled Cars
This paper presents our experience applying web services and active database technology in an automotive scenario. Particularly, we concentrate on developing an infrastructure for...
Mariano Cilia, Alejandro P. Buchmann
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 9 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei