Mining Sequential Patterns from Data Streams: a Centroid Approach

Alice Marascu 1 Florent Masseglia 1
1 AxIS - Usage-centered design, analysis and improvement of information systems
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt
Abstract : In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream processing, memory usage is restricted, new elements are generated continuously and have to be considered in a linear time, no blocking operator can be performed and the data can be examined only once. At this time, only a few methods has been proposed for mining sequential patterns in data streams. We argue that the main reason is the combinatory phenomenon related to sequential pattern mining. In this paper, we propose an algorithm based on sequences alignment for mining approximate sequential patterns in Web usage data streams. To meet the constraint of one scan, a greedy clustering algorithm associated to an alignment method is proposed. We will show that our proposal is able to extract relevant sequences with very low thresholds.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/inria-00461296
Contributor : Alice-Maria Marascu <>
Submitted on : Thursday, March 4, 2010 - 11:54:26 AM
Last modification on : Saturday, February 23, 2019 - 7:06:02 PM

Links full text

Identifiers

Collections

Citation

Alice Marascu, Florent Masseglia. Mining Sequential Patterns from Data Streams: a Centroid Approach. Journal for Intelligent Information Systems, Springer Netherlands, 2006, 27 (3), pp.291-307. ⟨10.1007/s10844-006-9954-6⟩. ⟨inria-00461296⟩

Share

Metrics

Record views

219