1217 search results - page 62 / 244 » On compressing frequent patterns |
151
click to vote
KDD
2006
ACM
16 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...
150
click to vote
FIMI
2003
15 years 5 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
139
click to vote
ISCI
2007
15 years 3 months ago
2007
In this paper, we propose a novel spatial mining algorithm, called 9DLT-Miner, to mine the spatial association rules from an image database, where every image is represented by th...
162
Voted
FQAS
2004
Springer
15 years 7 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
110
Voted
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...