63 search results - page 7 / 13 » Finding frequent items in data streams |
FIMI
2003
13 years 9 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
The retention of communication data has recently attracted much public interest, mostly because of the possibility of its misuse. In this paper, we present protocols that address ...
DMIN
2007
13 years 9 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique s...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...