Page 1 |
Save page Remove page | Previous | 1 of 126 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
COMPLEX PATTERN SEARCH IN SEQUENTIAL DATA
by
Leila Kaghazian
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
August 2008
Copyright 2008 Leila Kaghazian
Object Description
| Title | Complex pattern search in sequential data |
| Author | Kaghazian, Leila |
| Author email | kaghazia@usc.edu; leila_kaghazian@hotmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2008-06-24 |
| Date submitted | 2008 |
| Restricted until | Unrestricted |
| Date published | 2008-08-11 |
| Advisor (committee chair) | McLeod, Dennis |
| Advisor (committee member) |
Boehm, Barry Meshkati, Najmedin |
| Abstract | The need to search for complex and recurring patterns in database sequences, data streams and graphs is shared by many applications. Challenges in this problem include searching through large volumes of data in some database sequences, dealing with real-time data within a limited time frame and complexity of relations between tree-structured data. Feasible methods to search for patterns of interest, for data analysis purposes, will have to address these issues. In this thesis, we investigate the design and optimization of constructs that enable SQL to express complex patterns. In particular we propose the Recursive Sequential Pattern Search algorithm (RSPS) which is inspired by the KMP (Knuth-Morris-Pratt) string matching algorithm. RSPS exploits the inter-dependencies between elements of a sequential pattern to minimize repeated passes over the same data. Moreover we propose another novel algorithm, MCCPS (Multiple Concurrent Conjunctive Pattern Search), to look for complex patterns in single, and multi dimensional data. Performance gains derived from a set of experiments and a sensitivity analysis for RSPS and MCCPS are also discussed. Our results demonstrate dramatic speedup in search, of up to two order of magnitude. |
| Keyword | sequential data; pattern search; optimal search; data mining; pattern |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m1568 |
| Rights | Kaghazian, Leila |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-Kaghazian-2313 |
| Archival file | uscthesesreloadpub_Volume32/etd-Kaghazian-2313.pdf |
Description
| Title | Page 1 |
| Full text | COMPLEX PATTERN SEARCH IN SEQUENTIAL DATA by Leila Kaghazian A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) August 2008 Copyright 2008 Leila Kaghazian |
Comments
Post a Comment for Page 1
