1217 search results - page 33 / 244 » On compressing frequent patterns |
119
Voted
SSPR
2000
Springer
15 years 7 months ago
2000
Springer
In many applications, objects are represented by a collection of unorganized points that scan the surface of the object. In such cases, an efficient way of storing this information...
121
Voted
KDD
2002
ACM
16 years 4 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
135
Voted
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
153
Voted
SYRCODIS
2007
15 years 4 months ago
2007
A problem of association rules discovery in a multivariate time series is considered in this paper. A method for finding interpretable association rules between frequent qualitati...
120
Voted
PKDD
2005
Springer
15 years 9 months ago
2005
Springer
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...