7581 search results - page 1273 / 1517 » Incompleteness in Data Mining |
165
click to vote
EDBT
2011
ACM
14 years 8 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
135
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Finding a small set of representative instances for large datasets can bring various benefits to data mining practitioners so they can (1) build a learner superior to the one cons...
121
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
158
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
136
click to vote
SSDBM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract. Relational database systems are becoming increasingly popular in the scientific community to support the interactive exploration of large volumes of data. In this scenar...