Author(s):
Cavique, Luís 
Date: 2007
Persistent ID: http://hdl.handle.net/10400.2/1954
Origin: Repositório Aberto da Universidade Aberta
Subject(s): Data mining; Frequent sequence mining; Graph theory
Document details
A network algorithm to discover sequential patterns
Description
This paper addresses the discovery of sequential patterns in very large databases. Most of the existing algorithms use lattice structures in the space search that are very demanding computationally. The output of these algorithms generates a large number of rules. The aim of this work is to create a swift algorithm for the discovery of sequential patterns with a low time complexity. In this work, we also want to define tools that allow us to simplify the work of the final user, by offering a new visualization of the sequences, while bypassing the analysis of thousands of association rules.
This paper addresses the discovery of sequential patterns in very large databases. Most of the existing algorithms use lattice structures in the space search that are very demanding computationally. The output of these algorithms generates a large number of rules. The aim of this work is to create a swift algorithm for the discovery of sequential patterns with a low time complexity. In this work, we also want to define tools that allow us to simplify the work of the final user, by offering a new visualization of the sequences, while bypassing the analysis of thousands of association rules.
Document Type
Part of book or chapter of book
Language English
Language English
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||