An efficient algorithm for mining sequential patterns

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The temporal component of the spatio-temporal databases is the key factor that leads to large accumulation of data. It can be said that continuous collection of spatial data, leads to spatio-temporal databases. A event type sequence is called as an sequential pattern and extracting spatio-temporal sequential patterns from spatio-temporal event data sets paves way to define causal relationships between event types. In this paper, a data structure has been proposed to support efficient mining of sequential patterns.

Cite

CITATION STYLE

APA

Sunitha, G., Kumar, M. S., Sreedhar, B., & Jeevan Pradeep, K. (2008). An efficient algorithm for mining sequential patterns. Advances in Intelligent Systems and Computing, 542, 67–74. https://doi.org/10.1007/978-981-10-3223-3_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free