Sciweavers

113 search results - page 2 / 23
» Efficient Discovery of Frequent Approximate Sequential Patte...
Sort
View
SSD
2001
Springer
218views Database» more  SSD 2001»
13 years 12 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
13 years 12 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
14 years 13 days ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
ACMSE
2009
ACM
14 years 2 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang
ICDM
2002
IEEE
131views Data Mining» more  ICDM 2002»
14 years 13 days ago
Using Sequential and Non-Sequential Patterns in Predictive Web Usage Mining Tasks
We describe an efficient framework for Web personalization based on sequential and non-sequential pattern discovery from usage data. Our experimental results performed on real us...
Bamshad Mobasher, Honghua Dai, Tao Luo, Miki Nakag...