1217 search results - page 50 / 244 » On compressing frequent patterns |
156
Voted
WWW
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
148
Voted
ADBIS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
135
Voted
ICIAR
2004
Springer
15 years 9 months ago
2004
Springer
Frequently, it is observed that the sequence of indexes generated by a vector quantizer (VQ) contains a high degree of correlation, and, therefore, can be further compressed using ...
112
Voted
WISE
2006
Springer
15 years 9 months ago
2006
Springer
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...
104
Voted
DAWAK
2007
Springer
15 years 9 months ago
2007
Springer
Many studies of spatiotemporal pattern discovery partition data space into disjoint cells for effective processing. However, the discovery accuracy of the space-partitioning schem...