Matching Items (3)
Filtering by
- All Subjects: time series
- Creators: Bliss, Daniel
- Creators: Chowell-Punete, Gerardo
Description
Unsupervised learning of time series data, also known as temporal clustering, is a challenging problem in machine learning. This thesis presents a novel algorithm, Deep Temporal Clustering (DTC), to naturally integrate dimensionality reduction and temporal clustering into a single end-to-end learning framework, fully unsupervised. The algorithm utilizes an autoencoder for temporal dimensionality reduction and a novel temporal clustering layer for cluster assignment. Then it jointly optimizes the clustering objective and the dimensionality reduction objective. Based on requirement and application, the temporal clustering layer can be customized with any temporal similarity metric. Several similarity metrics and state-of-the-art algorithms are considered and compared. To gain insight into temporal features that the network has learned for its clustering, a visualization method is applied that generates a region of interest heatmap for the time series. The viability of the algorithm is demonstrated using time series data from diverse domains, ranging from earthquakes to spacecraft sensor data. In each case, the proposed algorithm outperforms traditional methods. The superior performance is attributed to the fully integrated temporal dimensionality reduction and clustering criterion.
ContributorsMadiraju, NaveenSai (Author) / Liang, Jianming (Thesis advisor) / Wang, Yalin (Thesis advisor) / He, Jingrui (Committee member) / Arizona State University (Publisher)
Created2018
Description
The amount of time series data generated is increasing due to the integration of sensor technologies with everyday applications, such as gesture recognition, energy optimization, health care, video surveillance. The use of multiple sensors simultaneously
for capturing different aspects of the real world attributes has also led to an increase in dimensionality from uni-variate to multi-variate time series. This has facilitated richer data representation but also has necessitated algorithms determining similarity between two multi-variate time series for search and analysis.
Various algorithms have been extended from uni-variate to multi-variate case, such as multi-variate versions of Euclidean distance, edit distance, dynamic time warping. However, it has not been studied how these algorithms account for asynchronous in time series. Human gestures, for example, exhibit asynchrony in their patterns as different subjects perform the same gesture with varying movements in their patterns at different speeds. In this thesis, we propose several algorithms (some of which also leverage metadata describing the relationships among the variates). In particular, we present several techniques that leverage the contextual relationships among the variates when measuring multi-variate time series similarities. Based on the way correlation is leveraged, various weighing mechanisms have been proposed that determine the importance of a dimension for discriminating between the time series as giving the same weight to each dimension can led to misclassification. We next study the robustness of the considered techniques against different temporal asynchronies, including shifts and stretching.
Exhaustive experiments were carried on datasets with multiple types and amounts of temporal asynchronies. It has been observed that accuracy of algorithms that rely on data to discover variate relationships can be low under the presence of temporal asynchrony, whereas in case of algorithms that rely on external metadata, robustness against asynchronous distortions tends to be stronger. Specifically, algorithms using external metadata have better classification accuracy and cluster separation than existing state-of-the-art work, such as EROS, PCA, and naive dynamic time warping.
for capturing different aspects of the real world attributes has also led to an increase in dimensionality from uni-variate to multi-variate time series. This has facilitated richer data representation but also has necessitated algorithms determining similarity between two multi-variate time series for search and analysis.
Various algorithms have been extended from uni-variate to multi-variate case, such as multi-variate versions of Euclidean distance, edit distance, dynamic time warping. However, it has not been studied how these algorithms account for asynchronous in time series. Human gestures, for example, exhibit asynchrony in their patterns as different subjects perform the same gesture with varying movements in their patterns at different speeds. In this thesis, we propose several algorithms (some of which also leverage metadata describing the relationships among the variates). In particular, we present several techniques that leverage the contextual relationships among the variates when measuring multi-variate time series similarities. Based on the way correlation is leveraged, various weighing mechanisms have been proposed that determine the importance of a dimension for discriminating between the time series as giving the same weight to each dimension can led to misclassification. We next study the robustness of the considered techniques against different temporal asynchronies, including shifts and stretching.
Exhaustive experiments were carried on datasets with multiple types and amounts of temporal asynchronies. It has been observed that accuracy of algorithms that rely on data to discover variate relationships can be low under the presence of temporal asynchrony, whereas in case of algorithms that rely on external metadata, robustness against asynchronous distortions tends to be stronger. Specifically, algorithms using external metadata have better classification accuracy and cluster separation than existing state-of-the-art work, such as EROS, PCA, and naive dynamic time warping.
ContributorsGarg, Yash (Author) / Candan, Kasim Selcuk (Thesis advisor) / Chowell-Punete, Gerardo (Committee member) / Tong, Hanghang (Committee member) / Davulcu, Hasan (Committee member) / Sapino, Maria Luisa (Committee member) / Arizona State University (Publisher)
Created2015
Description
The power of science lies in its ability to infer and predict the
existence of objects from which no direct information can be obtained
experimentally or observationally. A well known example is to
ascertain the existence of black holes of various masses in different
parts of the universe from indirect evidence, such as X-ray emissions.
In the field of complex networks, the problem of detecting
hidden nodes can be stated, as follows. Consider a network whose
topology is completely unknown but whose nodes consist of two types:
one accessible and another inaccessible from the outside world. The
accessible nodes can be observed or monitored, and it is assumed that time
series are available from each node in this group. The inaccessible
nodes are shielded from the outside and they are essentially
``hidden.'' The question is, based solely on the
available time series from the accessible nodes, can the existence and
locations of the hidden nodes be inferred? A completely data-driven,
compressive-sensing based method is developed to address this issue by utilizing
complex weighted networks of nonlinear oscillators, evolutionary game
and geospatial networks.
Both microbes and multicellular organisms actively regulate their cell
fate determination to cope with changing environments or to ensure
proper development. Here, the synthetic biology approaches are used to
engineer bistable gene networks to demonstrate that stochastic and
permanent cell fate determination can be achieved through initializing
gene regulatory networks (GRNs) at the boundary between dynamic
attractors. This is experimentally realized by linking a synthetic GRN
to a natural output of galactose metabolism regulation in yeast.
Combining mathematical modeling and flow cytometry, the
engineered systems are shown to be bistable and that inherent gene expression
stochasticity does not induce spontaneous state transitioning at
steady state. By interfacing rationally designed synthetic
GRNs with background gene regulation mechanisms, this work
investigates intricate properties of networks that illuminate possible
regulatory mechanisms for cell differentiation and development that
can be initiated from points of instability.
existence of objects from which no direct information can be obtained
experimentally or observationally. A well known example is to
ascertain the existence of black holes of various masses in different
parts of the universe from indirect evidence, such as X-ray emissions.
In the field of complex networks, the problem of detecting
hidden nodes can be stated, as follows. Consider a network whose
topology is completely unknown but whose nodes consist of two types:
one accessible and another inaccessible from the outside world. The
accessible nodes can be observed or monitored, and it is assumed that time
series are available from each node in this group. The inaccessible
nodes are shielded from the outside and they are essentially
``hidden.'' The question is, based solely on the
available time series from the accessible nodes, can the existence and
locations of the hidden nodes be inferred? A completely data-driven,
compressive-sensing based method is developed to address this issue by utilizing
complex weighted networks of nonlinear oscillators, evolutionary game
and geospatial networks.
Both microbes and multicellular organisms actively regulate their cell
fate determination to cope with changing environments or to ensure
proper development. Here, the synthetic biology approaches are used to
engineer bistable gene networks to demonstrate that stochastic and
permanent cell fate determination can be achieved through initializing
gene regulatory networks (GRNs) at the boundary between dynamic
attractors. This is experimentally realized by linking a synthetic GRN
to a natural output of galactose metabolism regulation in yeast.
Combining mathematical modeling and flow cytometry, the
engineered systems are shown to be bistable and that inherent gene expression
stochasticity does not induce spontaneous state transitioning at
steady state. By interfacing rationally designed synthetic
GRNs with background gene regulation mechanisms, this work
investigates intricate properties of networks that illuminate possible
regulatory mechanisms for cell differentiation and development that
can be initiated from points of instability.
ContributorsSu, Ri-Qi (Author) / Lai, Ying-Cheng (Thesis advisor) / Wang, Xiao (Thesis advisor) / Bliss, Daniel (Committee member) / Tepedelenlioğlu, Cihan (Committee member) / Arizona State University (Publisher)
Created2015