Mining serial positioning episode rules from event sequences and batch free top k sequential pattern discovery for data streams

dc.contributor.guideDhananjay Kumar
dc.coverage.spatialMining serial positioning episode rules from event sequences and batch free top k sequential pattern discovery for data streams
dc.creator.researcherPoongodi K
dc.date.accessioned2023-04-19T07:08:39Z
dc.date.available2023-04-19T07:08:39Z
dc.date.awarded2022
dc.date.completed2022
dc.date.registered
dc.description.abstractThe Frequent Episode Mining (FEM) is a challenging problem to identify frequent episodes from a sequence database where the rules discovered from episodes are used for prediction and decision making. An episode rule mining to extract useful and important patterns or episodes from large event sequences represent the temporal implication of associating the antecedent and consequent episodes. The work presented here has four major contributions to mine frequent episodes from event sequences and sequential pattern discovery in streaming data. The first research contribution deals with mining of serial episode rules using natural exponent inertia weight based particle swarm optimization algorithm from event sequences. The second work corresponds to the mining of serial positioning episode rules from event sequences using natural exponent inertia weight based swallow swarm optimization algorithm. In the third contribution, frequent serial episode rules are mined using forward and backward search technique from event sequential data. An adaptive hierarchical clustering and batch-free top-k sequential pattern mining from data streams is the fourth major contribution of this research work. newlineThe episode rules need to be mined with precise and serial based rule mining considering the temporal factor, so that, the occurrence time of the consequent is specified in contrast to the traditional episode rule mining. In the first proposed work, the fixed-gap episodes are generated with specific time constraints, and mining such episodes from whole sequence where the time span between any two events is a constant, are utilized to improve the system s performance. The existing technique for mining precise-positioning episode rules from event sequences, mines serial episodes resulting in enormous memory consumption newline
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions21cm
dc.format.extentxx,200p.
dc.identifier.urihttp://hdl.handle.net/10603/476980
dc.languageEnglish
dc.publisher.institutionFaculty of Information and Communication Engineering
dc.publisher.placeChennai
dc.publisher.universityAnna University
dc.relationp.190-199
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordFrequent episode mining
dc.subject.keywordParticle swarm optimization
dc.subject.keywordSpearman s correlation coefficient
dc.titleMining serial positioning episode rules from event sequences and batch free top k sequential pattern discovery for data streams
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 12
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
25.44 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
1.56 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_contents.pdf
Size:
205.23 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstracts.pdf
Size:
118.17 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter1.pdf
Size:
311.5 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: