1403 search results - page 203 / 281 » Set cover algorithms for very large datasets |
JMLR
2012
13 years 7 days ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
102
click to vote
ICMLA
2010
14 years 7 months ago
2010
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
126
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 2 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
108
click to vote
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...