Back to results list
Please use this identifier to cite or link to this item:
|Title:||Discovering spatio-temporal patterns in multivariate spatial time series||Authors:||Wu, Pak Kit||Advisors:||Chan, C. C. Keith (COMP)||Keywords:||Multivariate analysis
|Issue Date:||2019||Publisher:||The Hong Kong Polytechnic University||Abstract:||A multivariate spatial time series (MSTS) consists of a collection of values by a set of geographical coordinates accompanied by a set of multivariate time series (MTS). An MTS is composed of a number of temporally interrelated variables monitored over a period of time at successive time instants spaced at uniform time intervals. MTS data are generated massively due to recent developments in sensor and satellite technologies, medical measurements, climate informatics, and bioinformatics. These large-scale data encode important information about complex relations among individual time series. Many of these MTS are spatiotemporal by nature in which they are collected together with spatial location information such as latitude and longitude. For example, climate data are from sensors located in different regions, each of which collects periodic readings of variables such as humidity, wind speed, temperature, and rainfall intensity. A computational technique that is able to discover interesting patterns in MSTS data can lead to many applications in diverse areas of research and be helpful to society as well as to the economy. MSTS can be represented as a set of MTSs each of which is associated with a spatial location. Conventional time series analysis methods which consider only the time domain are often adopted to analyze MTS, but the spatial and temporal relationships associated with the individual time series in MSTS are usually ignored, or treated separately, during the pattern discovery process. For this reason, new effective techniques are required. In this thesis, we proposed some such techniques, in particular, that can be used to address the problems of identifying interesting patterns in MSTS and the classification and clustering of them. One of the classical examples of MTS is spatial trajectory data with x coordinate and y coordinate forming the different components of the MTS. In many cases, such data is also spatio-temporal as it may be associated with many spatiotemporal parameters such as velocity and direction etc. Mining spatial trajectories can have many applications in a variety of research areas. For example, in traffic data, finding patterns of driving behavior of moving objects can provide insight into many real applications such as auto insurance and vehicle safety checks. In this regard, we propose in this thesis a technique that can discover association patterns from the feature space characterizing the spatial trajectories. These discovered association patterns, treated as the driving behavior on the road, could be used for the classification of drivers. A classification algorithm has been developed based on the proposed technique to consider the variable length of multiple spatial trajectories of each driver to determine the class membership that exists between association patterns of these trajectories and the class. Integrated with an information theoretic measure, this classifier is able to predict and identify uniquely a driver based on driving patterns of unlabeled trajectories that are for or against a certain class membership. For performance evaluation, we have used it to solve problems in driver classification using their spatial trajectory data.
According to empirical studies on spatial data analysis, mining of MSTS should consider the spatial nature of the objects to be analyzed, their characteristics of the feature space and the uncertainty between the spatial units and their complex features. The proposed technique, to discover association patterns in MSTS, should consider both spatial and temporal information. This proposed technique not only can uncover the temporal and spatial association relationships of MSTS but also can tackle supervised and unsupervised learning tasks. This technique incorporates an initial MTS pattern mining algorithm to detect temporal association relationships from frequent patterns in a set of MTSs for each location. We have developed an algorithm to detect co-occurrence of the discovered temporal patterns across locations by mining a transformed spatiotemporal pattern matrix (STPM) that characterizes the feature space to form spatio-temporal patterns. That is to say, if the frequency of co-occurrence of the respective temporal patterns in different spatial units is significantly higher, the co-occurrence of the temporal patterns across locations is the spatial association patterns of interest. To determine if the frequency of their co-occurrences is significantly higher, we apply a statistical significance test to measure how significantly the observed frequency of the co-occurrences deviates from its expected frequency. Furthermore, we effectively integrate this spatio-temporal pattern-mining algorithm for classification and clustering by an information theoretic measure. If the set of MSTS is labeled, the discovered patterns can be weighted to support or against a certain class membership for the construction of a classifier. If the set of MSTS is unlabeled, the discovered patterns in one location are compared against those discovered in the others so that, by taking the spatial contiguity between locations into consideration, MSTS that have similar discovered patterns and are closer to each other are grouped together into the same cluster. To evaluate the performance of the algorithms, we have tested them on both synthetic and real-world data sets. We have also applied them to tackle several practical problems in some case studies. Both experimental results and findings from practical case studies show the proposed techniques to be promising for MSTS analysis.
|Description:||xxi, 186 pages : color illustrations
PolyU Library Call No.: [THS] LG51 .H577P COMP 2019 Wu
|URI:||http://hdl.handle.net/10397/80551||Rights:||All rights reserved.|
|Appears in Collections:||Thesis|
Show full item record
Files in This Item:
|991022208058203411_link.htm||For PolyU Users||167 B||HTML||View/Open|
|991022208058203411_pira.pdf||For All Users (Non-printable)||5.78 MB||Adobe PDF||View/Open|
Citations as of Aug 21, 2019
Citations as of Aug 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.