376 search results - page 55 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
SEBD
1996
13 years 9 months ago
1996
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
FIMI
2004
13 years 10 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...