Mining sequential rules common to several sequences with the window size constraint

Philippe Fournier-Viger*, Cheng Wei Wu, S. Tseng, Roger Nkambou

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations

Abstract

We present an algorithm for mining sequential rules common to several sequences, such that rules have to appear within a maximum time span. Experimental results with real-life datasets show that the algorithm can reduce the execution time, memory usage and the number of rules generated by several orders of magnitude compared to previous algorithms.

Original languageEnglish
Title of host publicationAdvances in Artificial Intelligence - 25th Canadian Conference on Artificial Intelligence, Canadian AI 2012, Proceedings
Pages299-304
Number of pages6
DOIs
StatePublished - 2012
Event25th Canadian Conference on Artificial Intelligence, AI 2012 - Toronto, ON, Canada
Duration: 28 May 201230 May 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7310 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th Canadian Conference on Artificial Intelligence, AI 2012
Country/TerritoryCanada
CityToronto, ON
Period28/05/1230/05/12

Keywords

  • sequence database
  • sequential rules
  • sliding-window
  • time

Fingerprint

Dive into the research topics of 'Mining sequential rules common to several sequences with the window size constraint'. Together they form a unique fingerprint.

Cite this