288 search results - page 15 / 58 » Estimating the number of frequent itemsets in a large databa... |
161
click to vote
ADBIS
2003
Springer
15 years 11 months ago
2003
Springer
Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we ...
168
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
188
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
149
click to vote
ACTA
2006
15 years 6 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
175
click to vote
KDD
2003
ACM
16 years 6 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 ...