156 search results - page 15 / 32 » Mining Frequent Itemsets from Secondary Memory |
FIMI
2004
13 years 8 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
IDA
2002
Springer
13 years 7 months ago
2002
Springer
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...