111 search results - page 5 / 23 » COFI approach for mining frequent itemsets revisited |
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
122
click to vote
JIIS
2007
14 years 9 months ago
2007
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
118
click to vote
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...