1458 search results - page 194 / 292 » Practical Preference Relations for Large Data Sets |
151
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
127
click to vote
AIIA
2007
Springer
15 years 11 months ago
2007
Springer
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
154
click to vote
VLDB
1998
ACM
15 years 9 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
165
click to vote
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
186
click to vote
SDM
2011
SIAM
14 years 8 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...