GeoStat Representations of Time Series for Fast Classification
- URL: http://arxiv.org/abs/2007.06682v3
- Date: Mon, 11 Jan 2021 22:03:10 GMT
- Title: GeoStat Representations of Time Series for Fast Classification
- Authors: Robert J. Ravier, Mohammadreza Soltani, Miguel Sim\~oes, Denis
Garagic, Vahid Tarokh
- Abstract summary: We introduce GeoStat representations for time series.
GeoStat representations are based off of a generalization of recent methods for trajectory classification.
We show that this methodology achieves good performance on a challenging dataset involving the classification of fishing vessels.
- Score: 30.987852463546698
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent advances in time series classification have largely focused on methods
that either employ deep learning or utilize other machine learning models for
feature extraction. Though successful, their power often comes at the
requirement of computational complexity. In this paper, we introduce GeoStat
representations for time series. GeoStat representations are based off of a
generalization of recent methods for trajectory classification, and summarize
the information of a time series in terms of comprehensive statistics of
(possibly windowed) distributions of easy to compute differential geometric
quantities, requiring no dynamic time warping. The features used are intuitive
and require minimal parameter tuning. We perform an exhaustive evaluation of
GeoStat on a number of real datasets, showing that simple KNN and SVM
classifiers trained on these representations exhibit surprising performance
relative to modern single model methods requiring significant computational
power, achieving state of the art results in many cases. In particular, we show
that this methodology achieves good performance on a challenging dataset
involving the classification of fishing vessels, where our methods achieve good
performance relative to the state of the art despite only having access to
approximately two percent of the dataset used in training and evaluating this
state of the art.
Related papers
- Exploiting Local Features and Range Images for Small Data Real-Time Point Cloud Semantic Segmentation [4.02235104503587]
In this paper, we harness the information from the three-dimensional representation to proficiently capture local features.
A GPU-based KDTree allows for rapid building, querying, and enhancing projection with straightforward operations.
We show that a reduced version of our model not only demonstrates strong competitiveness against full-scale state-of-the-art models but also operates in real-time.
arXiv Detail & Related papers (2024-10-14T13:49:05Z) - Time Series Representation Models [2.724184832774005]
Time series analysis remains a major challenge due to its sparse characteristics, high dimensionality, and inconsistent data quality.
Recent advancements in transformer-based techniques have enhanced capabilities in forecasting and imputation.
We propose a new architectural concept for time series analysis based on introspection.
arXiv Detail & Related papers (2024-05-28T13:25:31Z) - Benchmarking Data Efficiency and Computational Efficiency of Temporal
Action Localization Models [42.06124795143787]
In temporal action localization, given an input video, the goal is to predict which actions it contains, where they begin, and where they end.
This work explores and measures how current deep temporal action localization models perform in settings constrained by the amount of data or computational power.
arXiv Detail & Related papers (2023-08-24T20:59:55Z) - MADS: Modulated Auto-Decoding SIREN for time series imputation [9.673093148930874]
We propose MADS, a novel auto-decoding framework for time series imputation, built upon implicit neural representations.
We evaluate our model on two real-world datasets, and show that it outperforms state-of-the-art methods for time series imputation.
arXiv Detail & Related papers (2023-07-03T09:08:47Z) - Generalization Properties of Retrieval-based Models [50.35325326050263]
Retrieval-based machine learning methods have enjoyed success on a wide range of problems.
Despite growing literature showcasing the promise of these models, the theoretical underpinning for such models remains underexplored.
We present a formal treatment of retrieval-based models to characterize their generalization ability.
arXiv Detail & Related papers (2022-10-06T00:33:01Z) - Learning from Temporal Spatial Cubism for Cross-Dataset Skeleton-based
Action Recognition [88.34182299496074]
Action labels are only available on a source dataset, but unavailable on a target dataset in the training stage.
We utilize a self-supervision scheme to reduce the domain shift between two skeleton-based action datasets.
By segmenting and permuting temporal segments or human body parts, we design two self-supervised learning classification tasks.
arXiv Detail & Related papers (2022-07-17T07:05:39Z) - Towards Similarity-Aware Time-Series Classification [51.2400839966489]
We study time-series classification (TSC), a fundamental task of time-series data mining.
We propose Similarity-Aware Time-Series Classification (SimTSC), a framework that models similarity information with graph neural networks (GNNs)
arXiv Detail & Related papers (2022-01-05T02:14:57Z) - Temporal Attention-Augmented Graph Convolutional Network for Efficient
Skeleton-Based Human Action Recognition [97.14064057840089]
Graphal networks (GCNs) have been very successful in modeling non-Euclidean data structures.
Most GCN-based action recognition methods use deep feed-forward networks with high computational complexity to process all skeletons in an action.
We propose a temporal attention module (TAM) for increasing the efficiency in skeleton-based action recognition.
arXiv Detail & Related papers (2020-10-23T08:01:55Z) - From Static to Dynamic Node Embeddings [61.58641072424504]
We introduce a general framework for leveraging graph stream data for temporal prediction-based applications.
Our proposed framework includes novel methods for learning an appropriate graph time-series representation.
We find that the top-3 temporal models are always those that leverage the new $epsilon$-graph time-series representation.
arXiv Detail & Related papers (2020-09-21T16:48:29Z) - Region Comparison Network for Interpretable Few-shot Image
Classification [97.97902360117368]
Few-shot image classification has been proposed to effectively use only a limited number of labeled examples to train models for new classes.
We propose a metric learning based method named Region Comparison Network (RCN), which is able to reveal how few-shot learning works.
We also present a new way to generalize the interpretability from the level of tasks to categories.
arXiv Detail & Related papers (2020-09-08T07:29:05Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.