313 search results - page 25 / 63 » Mining Frequent Itemsets in a Stream |
103
click to vote
CAEPIA
2003
Springer
15 years 2 months ago
2003
Springer
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
KES
2004
Springer
15 years 3 months ago
2004
Springer
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
82
Voted
KAIS
2008
14 years 9 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
63
Voted
IDA
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
179
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...