26 search results - page 2 / 6 » An Efficient Algorithm for Mining Frequent Sequences by a Ne... |
KDD
2002
ACM
14 years 5 months ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
ADC
2003
Springer
13 years 10 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
DMIN
2006
13 years 6 months ago
2006
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
RCIS
2010
13 years 3 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...