6 search results - page 1 / 2 » A new concise representation of frequent itemsets using gene... |
KAIS
2008
13 years 4 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...
JIIS
2010
12 years 11 months ago
2010
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
ICDM
2005
IEEE
13 years 10 months ago
2005
IEEE
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
ADMA
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we study the maintenance of frequent patterns in the context of the generator representation. The generator representation is a concise and lossless representation o...
KDD
2006
ACM
14 years 4 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...