中文
相关论文

相关论文: Aligning Time Series on Incomparable Spaces

200 篇论文

Gromov-Wasserstein (GW) is a powerful tool to compare probability measures whose supports are in different metric spaces. GW suffers however from a computational drawback since it requires to solve a complex non-convex quadratic program. We…

机器学习 · 统计学 2020-06-18 Tam Le , Nhat Ho , Makoto Yamada

There have been several recent efforts towards developing representations for multivariate time-series in an unsupervised learning framework. Such representations can prove beneficial in tasks such as activity recognition, health…

机器学习 · 计算机科学 2022-09-23 Yitian Zhang , Florence Regol , Antonios Valkanas , Mark Coates

The Dynamic Mode Decomposition (DMD) extracted dynamic modes are the non-orthogonal eigenvectors of the matrix that best approximates the one-step temporal evolution of the multivariate samples. In the context of dynamical system analysis,…

统计理论 · 数学 2020-03-09 Arvind Prasadan , Raj Rao Nadakuditi

Gromov-Wasserstein (GW) distance is a powerful tool for comparing and aligning probability distributions supported on different metric spaces. Recently, GW has become the main modeling technique for aligning heterogeneous data for a wide…

机器学习 · 计算机科学 2023-10-31 Lemin Kong , Jiajin Li , Jianheng Tang , Anthony Man-Cho So

In this paper, we study the problem of locating a predefined sequence of patterns in a time series. In particular, the studied scenario assumes a theoretical model is available that contains the expected locations of the patterns. This…

机器学习 · 计算机科学 2018-02-20 Steven Van Vaerenbergh , Ignacio Santamaria , Victor Elvira , Matteo Salvatori

As a valid metric of metric-measure spaces, Gromov-Wasserstein (GW) distance has shown the potential for matching problems of structured data like point clouds and graphs. However, its application in practice is limited due to the high…

机器学习 · 计算机科学 2023-01-10 Mengyu Li , Jun Yu , Hongteng Xu , Cheng Meng

Time series with large discontinuities are common in many scenarios. However, existing distance-based algorithms (e.g., DTW and its derivative algorithms) may perform poorly in measuring distances between these time series pairs. In this…

数据库 · 计算机科学 2020-09-24 Jiabo He , Sarah Erfani , Sudanthi Wijewickrema , Stephen O'Leary , Kotagiri Ramamohanarao

Detecting anomalous time series is key for scientific, medical and industrial tasks, but is challenging due to its inherent unsupervised nature. In recent years, progress has been made on this task by learning increasingly more complex…

机器学习 · 计算机科学 2022-02-09 Yedid Hoshen

The Gromov-Wasserstein (GW) distance is a powerful tool for comparing metric measure spaces which has found broad applications in data science and machine learning. Driven by the need to analyze datasets whose objects have increasingly…

度量几何 · 数学 2026-03-10 Martin Bauer , Facundo Mémoli , Tom Needham , Mao Nishino

We propose a novel approach for comparing distributions whose supports do not necessarily lie on the same metric space. Unlike Gromov-Wasserstein (GW) distance which compares pairwise distances of elements from each distribution, we…

机器学习 · 统计学 2021-04-23 Mokhtar Z. Alaya , Maxime Bérar , Gilles Gasso , Alain Rakotomamonjy

In well logging operations using the oil-based mud (OBM) microresistivity imager, which employs an interleaved design with upper and lower pad sets, depth misalignment issues persist between the pad images even after velocity correction.…

计算机视觉与模式识别 · 计算机科学 2025-12-02 Fengfeng Li , Zhou Feng , Hongliang Wu , Hao Zhang , Han Tian , Peng Liu , Lixin Yuan

The rich information underlying graphs has inspired further investigation of unsupervised graph representation. Existing studies mainly depend on node features and topological properties within static graphs to create self-supervised…

机器学习 · 计算机科学 2026-05-27 Yiming Xu , Zhen Peng , Bin Shi , Xu Hua , Bo Dong

This paper introduces a data-driven time embedding method for modeling long-range seasonal dependencies in spatiotemporal forecasting tasks. The proposed approach employs Dynamic Mode Decomposition (DMD) to extract temporal modes directly…

机器学习 · 计算机科学 2025-08-05 Menglin Kong , Vincent Zhihao Zheng , Xudong Wang , Lijun Sun

The Gromov-Wasserstein (GW) problem, a variant of the classical optimal transport (OT) problem, has attracted growing interest in the machine learning and data science communities due to its ability to quantify similarity between measures…

机器学习 · 计算机科学 2025-03-25 Yikun Bai , Abihith Kothapalli , Hengrong Du , Rocio Diaz Martin , Soheil Kolouri

Computing a sample mean of time series under dynamic time warping (DTW) is NP-hard. Consequently, there is an ongoing research effort to devise efficient heuristics. The majority of heuristics have been developed for the constrained sample…

数据结构与算法 · 计算机科学 2020-02-26 Brijnesh Jain , Vincent Froese , David Schultz

Generative models like Generative Adversarial Networks (GANs) and Variational Autoencoders (VAEs) often fail to capture the full diversity of their training data, leading to mode collapse. While this issue is well-explored in image…

机器学习 · 计算机科学 2024-12-17 Amime Mohamed Aboussalah , Yassine Abbahaddou

Gromov-Wasserstein distance has found many applications in machine learning due to its ability to compare measures across metric spaces and its invariance to isometric transformations. However, in certain applications, this invariance…

机器学习 · 计算机科学 2023-07-20 Pinar Demetci , Quang Huy Tran , Ievgen Redko , Ritambhara Singh

The Gromov-Wasserstein (GW) distance has gained increasing interest in the machine learning community in recent years, as it allows for the comparison of measures in different metric spaces. To overcome the limitations imposed by the equal…

机器学习 · 计算机科学 2025-03-28 Yikun Bai , Rocio Diaz Martin , Abihith Kothapalli , Hengrong Du , Xinran Liu , Soheil Kolouri

Visualizing multiple time series presents fundamental tradeoffs between scalability and visual clarity. Time series capture the behavior of many large-scale real-world processes, from stock market trends to urban activities. Users often…

While large volumes of unlabeled data are usually available, associated labels are often scarce. The unsupervised domain adaptation problem aims at exploiting labels from a source domain to classify data from a related, yet different,…