|
DSpace at Cochin University >
Department of Computer Science >
Seminar Reports >
MTech 2010-2012 Batch >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/3293
|
| Title: | SEQUENTIAL PATTERN MINING |
| Authors: | REMYAMOL K. M |
| Keywords: | frequent patterns, associations, pattern mining, candidate generation |
| Issue Date: | 4-Jun-2011 |
| Abstract: | Concept was introduced by Rakesh Agrawal and
Ramakrishnan Srikant
domain of Knowledge Discovery. Sequential pattern mining
is the mining of frequently occurring ordered events or
subsequences as patterns. It aimed to retrieve frequent
patterns in the sequences of products purchased by
customers through time ordered transactions. Several
algorithms were proposed. The very first was Apriori
algorithm, which was put forward by the founders itself.
Later more scalable algorithms for complex applications
were developed. Eg: GSP, SPADE, PrefixSpan, etc.
in
1995.It is active field in the
The area underwent considerable advancements
since it’s introduction in a short span of time. Other
areas
include Web access pattern analysis, weather prediction,
production processes, and network intrusion detection.
Due to the exponential shoot in the amount of data
generated in the world every second, it’s application
on different domains gains more importance.
in
which
sequential
patterns
can |
| URI: | http://hdl.handle.net/123456789/3293 |
| Appears in Collections: | MTech 2010-2012 Batch
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|