7228 search results - page 833 / 1446 » From Algorithmic to Subjective Randomness |
175
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
164
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model o...
197
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
218
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
269
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...