Sciweavers

78 search results - page 11 / 16
» BIDE: Efficient Mining of Frequent Closed Sequences
Sort
View
JIIS
2010
106views more  JIIS 2010»
13 years 2 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...
EDBT
2009
ACM
170views Database» more  EDBT 2009»
13 years 11 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
JIPS
2010
154views more  JIPS 2010»
13 years 2 months ago
Mining Spatio-Temporal Patterns in Trajectory Data
Spatio-temporal patterns extracted from historical trajectories of moving objects reveal important knowledge about movement behavior for high quality LBS services. Existing approac...
Juyoung Kang 0002, Hwan-Seung Yong
PAKDD
2001
ACM
148views Data Mining» more  PAKDD 2001»
13 years 12 months ago
Scalable Hierarchical Clustering Method for Sequences of Categorical Values
Data clustering methods have many applications in the area of data mining. Traditional clustering algorithms deal with quantitative or categorical data points. However, there exist...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
14 years 8 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj