237 search results - page 28 / 48 » Mining Frequent Itemsets Using Re-Usable Data Structure |
KDD
2007
ACM
14 years 1 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
SIGMOD
2000
ACM
14 years 1 days ago
2000
ACM
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. Increasing security concerns have led to a surge in w...
FIMI
2003
13 years 9 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...