Capturing Dynamics of Time-Varying Data via Topology
- URL: http://arxiv.org/abs/2010.05780v2
- Date: Mon, 28 Jun 2021 14:10:20 GMT
- Title: Capturing Dynamics of Time-Varying Data via Topology
- Authors: Lu Xian, Henry Adams, Chad M. Topaz, Lori Ziegelmeier
- Abstract summary: We introduce a new tool to summarize time-varying metric spaces: a crocker stack.
A time-varying collection of metric spaces as formed by a moving school of fish or flock of birds can contain a vast amount of information.
We demonstrate the utility of crocker stacks for a parameter identification task involving an influential model of biological aggregations.
- Score: 0.5276232626689568
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: One approach to understanding complex data is to study its shape through the
lens of algebraic topology. While the early development of topological data
analysis focused primarily on static data, in recent years, theoretical and
applied studies have turned to data that varies in time. A time-varying
collection of metric spaces as formed, for example, by a moving school of fish
or flock of birds, can contain a vast amount of information. There is often a
need to simplify or summarize the dynamic behavior. We provide an introduction
to topological summaries of time-varying metric spaces including vineyards
[19], crocker plots [56], and multiparameter rank functions [37]. We then
introduce a new tool to summarize time-varying metric spaces: a crocker stack.
Crocker stacks are convenient for visualization, amenable to machine learning,
and satisfy a desirable continuity property which we prove. We demonstrate the
utility of crocker stacks for a parameter identification task involving an
influential model of biological aggregations [58]. Altogether, we aim to bring
the broader applied mathematics community up-to-date on topological summaries
of time-varying metric spaces.
Related papers
- Explaining Datasets in Words: Statistical Models with Natural Language Parameters [66.69456696878842]
We introduce a family of statistical models -- including clustering, time series, and classification models -- parameterized by natural language predicates.
We apply our framework to a wide range of problems: taxonomizing user chat dialogues, characterizing how they evolve across time, finding categories where one language model is better than the other.
arXiv Detail & Related papers (2024-09-13T01:40:20Z) - Discovering symbolic expressions with parallelized tree search [59.92040079807524]
Symbolic regression plays a crucial role in scientific research thanks to its capability of discovering concise and interpretable mathematical expressions from data.
Existing algorithms have faced a critical bottleneck of accuracy and efficiency over a decade when handling problems of complexity.
We introduce a parallelized tree search (PTS) model to efficiently distill generic mathematical expressions from limited data.
arXiv Detail & Related papers (2024-07-05T10:41:15Z) - Time-Aware Knowledge Representations of Dynamic Objects with
Multidimensional Persistence [41.32931849366751]
We propose a new approach to a time-aware knowledge representation mechanism that focuses on implicit time-dependent topological information.
In particular, we propose a new approach, named textitTemporal MultiPersistence (TMP), which produces multidimensional topological fingerprints of the data.
TMP method improves the computational efficiency of the state-of-the-art multipersistence summaries up to 59.5 times.
arXiv Detail & Related papers (2024-01-24T00:33:53Z) - Adversarial Estimation of Topological Dimension with Harmonic Score Maps [7.34158170612151]
We show that it is possible to retrieve the topological dimension of the manifold learned by the score map.
We then introduce a novel method to measure the learned manifold's topological dimension using adversarial attacks.
arXiv Detail & Related papers (2023-12-11T22:29:54Z) - Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure.
We introduce a new class of manifold, named soft manifold, that can solve this situation.
Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
arXiv Detail & Related papers (2023-11-29T12:48:33Z) - Large Models for Time Series and Spatio-Temporal Data: A Survey and
Outlook [95.32949323258251]
Temporal data, notably time series andtemporal-temporal data, are prevalent in real-world applications.
Recent advances in large language and other foundational models have spurred increased use in time series andtemporal data mining.
arXiv Detail & Related papers (2023-10-16T09:06:00Z) - Spatiotemporal k-means [39.98633724527769]
We propose a twotemporal clustering method called k-means (STk) that is able to analyze multi-scale clusters.
We show how STkM can be extended to more complex machine learning tasks, particularly unsupervised region of interest detection and tracking in videos.
arXiv Detail & Related papers (2022-11-10T04:40:31Z) - Novel Features for Time Series Analysis: A Complex Networks Approach [62.997667081978825]
Time series data are ubiquitous in several domains as climate, economics and health care.
Recent conceptual approach relies on time series mapping to complex networks.
Network analysis can be used to characterize different types of time series.
arXiv Detail & Related papers (2021-10-11T13:46:28Z) - Smart Vectorizations for Single and Multiparameter Persistence [8.504400925390296]
We introduce two new topological summaries for single and multi-persistence persistence, namely, saw functions and multi-persistence grid functions.
These new topological summaries can be regarded as the complexity measures of the evolving subspaces determined by the filtration.
We derive theoretical guarantees on the stability of the new saw and multi-persistence grid functions and illustrate their applicability for graph classification tasks.
arXiv Detail & Related papers (2021-04-10T15:09:31Z) - Can neural networks learn persistent homology features? [1.1816942730023885]
Topological data analysis uses tools from topology to create representations of data.
In our work, we explore the possibility of learning several types of features extracted from persistence diagrams using neural networks.
arXiv Detail & Related papers (2020-11-30T10:58:53Z) - A Trainable Optimal Transport Embedding for Feature Aggregation and its
Relationship to Attention [96.77554122595578]
We introduce a parametrized representation of fixed size, which embeds and then aggregates elements from a given input set according to the optimal transport plan between the set and a trainable reference.
Our approach scales to large datasets and allows end-to-end training of the reference, while also providing a simple unsupervised learning mechanism with small computational cost.
arXiv Detail & Related papers (2020-06-22T08:35:58Z)
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.