78 search results - page 8 / 16 » BIDE: Efficient Mining of Frequent Closed Sequences |
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
ADBIS
2000
Springer
13 years 12 months ago
2000
Springer
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Eff...
SSD
2001
Springer
13 years 12 months ago
2001
Springer
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
TKDE
1998
13 years 7 months ago
1998
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...