Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/341612
Title: Optimized pattern matching in time series data using segmentation techniques
Researcher: Rajalakshmi, D
Guide(s): Dinakarnan, K
Keywords: Engineering and Technology
Computer Science
Computer Science Information Systems
Segmentation techniques
Pattern matching
University: Anna University
Completed Date: 2019
Abstract: In recent years, time series data mining has become an active research area due to the rapid proliferation of temporal-dependent applications. Owing to the continuous updation of data streams at high bit rates, storing and processing the entire data streams becomes impractical. Hence, it is essential to reduce the dimensionality. Pattern matching in time series often faces significant challenges due to the inconsistent and incomplete data. Most of the dimensionality reduction schemes are designed based on the assumption that every class of samples follows the Gaussian distribution. Lack of this property in real time data distribution does not allow dimensionality reduction techniques to characterize the different classes well and measure the data uncertainty accurately. This research work addresses these constraints in the pattern matching model through three contributions such as Pattern Matching using Ant Colony Optimization (PM-ACO), Pattern Matching using Particle Swarm Optimization (PM-PSO), and Handling UNcertainty and missing value prediction in Time series (HUNT). The initial work is PM-ACO that employs two segmentation methods such as Perceptually Important Points Method (PIP) and Piecewise Aggregate Approximation Method (PAA). It applies the segmentation method as the preprocessing step of the pattern matching process. Then, PM-ACO stores the segmented patterns in an Optimal Binary Search Tree (OBST) based on either time series characteristics or mean values. By applying the ACO, it matches the current window of the time series data with a specific pattern efficiently. The PIP based proposed pattern matching approach has gained 18% precision, 20% recall, 18.7% F-measure, and 25% accuracy than the existing Brute force based pattern matching approach. Compared to the Brute force based pattern matching approach, the PAA segmentation based PM-ACO approach has improved the precision by 20%, recall by 17%, Fmeasure by 18.4%, and accuracy by 15%. newline
Pagination: xx,188 p.
URI: http://hdl.handle.net/10603/341612
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File26.48 kBAdobe PDFView/Open
02_certificates.pdf123.8 kBAdobe PDFView/Open
03_vivaproceedings.pdf209.91 kBAdobe PDFView/Open
04_bonafidecertificate.pdf138 kBAdobe PDFView/Open
05_abstracts.pdf7.22 kBAdobe PDFView/Open
06_acknowledgements.pdf155.27 kBAdobe PDFView/Open
07_contents.pdf13.28 kBAdobe PDFView/Open
08_listoftables.pdf4.46 kBAdobe PDFView/Open
09_listoffigures.pdf5.18 kBAdobe PDFView/Open
10_listofabbreviations.pdf6.96 kBAdobe PDFView/Open
11_chapter1.pdf185.95 kBAdobe PDFView/Open
12_chapter2.pdf127.46 kBAdobe PDFView/Open
13_chapter3.pdf143.7 kBAdobe PDFView/Open
14_chapter4.pdf85.6 kBAdobe PDFView/Open
15_chapter5.pdf105.01 kBAdobe PDFView/Open
16_chapter6.pdf636.67 kBAdobe PDFView/Open
17_conclusion.pdf19.72 kBAdobe PDFView/Open
18_references.pdf90.95 kBAdobe PDFView/Open
19_listofpublications.pdf16.36 kBAdobe PDFView/Open
80_recommendation.pdf54.83 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: