1217 search results - page 51 / 244 » On compressing frequent patterns |
153
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
130
Voted
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
While noise is usually regarded as a problem of the image formation process, we observe that it is also frequently part of natural texture. In this paper, we present a concept for...
123
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
136
Voted
ICCD
2003
IEEE
16 years 17 days ago
2003
IEEE
This paper presents a pinpoint test set relaxation method for test compression that maximally derives the capability of a run-length encoding technique such as Golomb coding or fr...
153
Voted
EDBT
2011
ACM
14 years 7 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...