Indexed Bit Map (IBM) for Mining Frequent Sequences

11 years 10 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the database thanks to an indexed structure associated to a bit map representation. Thus, it allows a fast data access and a compact storage in main memory. The experimental results show the efficiency of our method compared to existing algorithms. It has been tested on synthetic data and on real data containing sequences of activities of a urban population time-use survey.
Lionel Savary, Karine Zeitouni
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PKDD
Authors Lionel Savary, Karine Zeitouni
Comments (0)