252 search results - page 11 / 51 » Mining Frequent Patterns without Candidate Generation |
ICDM
2002
IEEE
14 years 24 days ago
2002
IEEE
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
DAWAK
2010
Springer
13 years 9 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
GFKL
2007
Springer
13 years 11 months ago
2007
Springer
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
CIDM
2007
IEEE
13 years 8 months ago
2007
IEEE
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering c...