The problem of time-series retrieval arises in many fields of science and constitutes many important sub-problems including indexing, storage, representation, similarity measurement, etc. The center piece of time-series retrieval is, however, measurement of similarity between the query and the stored sequences in the data-base. Since different time-series sampled from similar phenomena can have variable lengths and/or warping, simple distance metrics such as Euclidean distance are either undefined or do not provide an accurate similarity measure. Therefore, alignment methods such as dynamic time warping have been proposed. They essentially rely on the distance between every sample point of contrasting sequences and recover their alignment using dynamic programming. These algorithms are effective when the sequences are noise-free and causal. In this work we introduce the concept of segmental sequence alignment. We claim that dynamically dividing the contrasting sequences into subsequences and recovering the optimal and monotonic matching between them instead of individual time-points can result in constructing a similarity measure more robust to noise and non-causality. We propose two different approaches and variants of them to accomplish segmental sequence alignment. The first proposed approach is an isotonic extension of Canonical Correlation Analysis (CCA) properly constrained to satisfy the time monotonicity constraint necessary for an alignment algorithm. The second approach is an extension of pair-HMM, which is a probabilistic model for aligning sequences. We have defined a proper observation model and efficient learning and inference algorithms to jointly recover the segmentation and alignment from segmental pair-HMM. We also propose a relaxation to the probabilistic model to increase the computational efficiency. We have shown the utility of our proposed techniques through extensive experiments on both synthetic and real-world data. We have applied our methods to various data sets from EEG signals to human activity. Our methods showed generally significant improvement over traditional models especially in instances when the sequences are corrupted by high levels of noise or are locally non-causal.
Subject (authority = RUETD)
Topic
Computer Science
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_4898
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
xi, 87 p. : ill.
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = vita)
Includes vita
Note (type = statement of responsibility)
by Shahriar Shariat Talkhoonche
Subject (authority = ETD-LCSH)
Topic
Information retrieval--Computer programs
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
Rutgers University. Graduate School - New Brunswick
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.