Evolutionary Robust Clustering Over Time for Temporal Data

• URL: http://arxiv.org/abs/2106.07252v1
• Date: Mon, 14 Jun 2021 09:07:42 GMT
• Title: Evolutionary Robust Clustering Over Time for Temporal Data
• Abstract summary: In many clustering scenes, data samples' attribute values change over time. This paper proposes a new clustering framework called evolutionary robust clustering over time. One significant innovation of the proposed framework is processing the temporal smoothness in an a posteriori manner.
• Score: 19.246970766964033
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In many clustering scenes, data samples' attribute values change over time. For such data, we are often interested in obtaining a partition for each time step and tracking the dynamic change of partitions. Normally, a smooth change is assumed for data to have a temporal smooth nature. Existing algorithms consider the temporal smoothness as an a priori preference and bias the search towards the preferred direction. This a priori manner leads to a risk of converging to an unexpected region because it is not always the case that a reasonable preference can be elicited given the little prior knowledge about the data. To address this issue, this paper proposes a new clustering framework called evolutionary robust clustering over time. One significant innovation of the proposed framework is processing the temporal smoothness in an a posteriori manner, which avoids unexpected convergence that occurs in existing algorithms. Furthermore, the proposed framework automatically tunes the weight of smoothness without data's affinity matrix and predefined parameters, which holds better applicability and scalability. The effectiveness and efficiency of the proposed framework are confirmed by comparing with state-of-the-art algorithms on both synthetic and real datasets.

Related papers

• Amortized Neural Clustering of Time Series based on Statistical Features [7.076900172535537]
  This paper introduces an algorithm-agnostic approach to feature-based time series clustering via amortized neural inference.<n>By training neural networks to approximate the optimal partitioning rule from simulated data, the proposed framework reduces reliance on conventional clustering methods.<n>One version of the method can automatically determine the number of clusters, avoiding ad-hoc selection procedures.
  arXiv  Detail & Related papers  (2026-05-13T07:54:55Z)
• Nonparametric estimation of time-varying network connections by multi-stage smoothing [7.678575259856196]
  We consider the problem of estimating the underlying edge probabilities of a time-varying network observed at multiple time points.<n>We propose a multi-stage smoothing estimator that first applies temporal local smoothing to each edge and then performs node-domain smoothing.
  arXiv  Detail & Related papers  (2026-05-07T19:05:14Z)
• FedTeddi: Temporal Drift and Divergence Aware Scheduling for Timely Federated Edge Learning [12.104759384825705]
  Federated edge learning (FEEL) enables collaborative model training across distributed clients over wireless networks without exposing raw data.<n>A critical challenge is how to adapt models in a timely yet efficient manner to such evolving data.<n>We propose FedTeddi, a temporal-drift-and-divergence-aware scheduling algorithm that facilitates fast convergence of FEEL.
  arXiv  Detail & Related papers  (2025-09-09T02:33:48Z)
• tPARAFAC2: Tracking evolving patterns in (incomplete) temporal data [0.7285444492473742]
  We introduce t(emporal)PARAFAC2 which utilizes temporal smoothness regularization on the evolving factors. Our numerical experiments on both simulated and real datasets demonstrate the effectiveness of the temporal smoothness regularization.
  arXiv  Detail & Related papers  (2024-07-01T15:10:55Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Diffeomorphic Transformations for Time Series Analysis: An Efficient Approach to Nonlinear Warping [0.0]
  The proliferation and ubiquity of temporal data across many disciplines has sparked interest for similarity, classification and clustering methods. Traditional distance measures such as the Euclidean are not well-suited due to the time-dependent nature of the data. This thesis proposes novel elastic alignment methods that use parametric & diffeomorphic warping transformations.
  arXiv  Detail & Related papers  (2023-09-25T10:51:47Z)
• Temporal Smoothness Regularisers for Neural Link Predictors [8.975480841443272]
  We show that a simple method like TNTComplEx can produce significantly more accurate results than state-of-the-art methods. We also evaluate the impact of a wide range of temporal smoothing regularisers on two state-of-the-art temporal link prediction models.
  arXiv  Detail & Related papers  (2023-09-16T16:52:49Z)
• Large-scale Fully-Unsupervised Re-Identification [78.47108158030213]
  We propose two strategies to learn from large-scale unlabeled data. The first strategy performs a local neighborhood sampling to reduce the dataset size in each without violating neighborhood relationships. A second strategy leverages a novel Re-Ranking technique, which has a lower time upper bound complexity and reduces the memory complexity from O(n2) to O(kn) with k n.
  arXiv  Detail & Related papers  (2023-07-26T16:19:19Z)
• Time Series Forecasting via Semi-Asymmetric Convolutional Architecture with Global Atrous Sliding Window [0.0]
  The proposed method in this paper is designed to address the problem of time series forecasting. Most of modern models only focus on a short range of information, which are fatal for problems such as time series forecasting. We make three main contributions that are experimentally verified to have performance advantages.
  arXiv  Detail & Related papers  (2023-01-31T15:07:31Z)
• Doubly Inhomogeneous Reinforcement Learning [4.334006170547247]
  We propose an original algorithm to determine the best data chunks" that display similar dynamics over time and across individuals for policy learning. Our method is general, and works with a wide range of clustering and change point detection algorithms.
  arXiv  Detail & Related papers  (2022-11-08T03:41:14Z)
• Smoothed Online Learning is as Easy as Statistical Learning [77.00766067963195]
  We provide the first oracle-efficient, no-regret algorithms in this setting. We show that if a function class is learnable in the classical setting, then there is an oracle-efficient, no-regret algorithm for contextual bandits.
  arXiv  Detail & Related papers  (2022-02-09T19:22:34Z)
• Cluster-and-Conquer: A Framework For Time-Series Forecasting [94.63501563413725]
  We propose a three-stage framework for forecasting high-dimensional time-series data. Our framework is highly general, allowing for any time-series forecasting and clustering method to be used in each step. When instantiated with simple linear autoregressive models, we are able to achieve state-of-the-art results on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-10-26T20:41:19Z)
• FedPD: A Federated Learning Framework with Optimal Rates and Adaptivity to Non-IID Data [59.50904660420082]
  Federated Learning (FL) has become a popular paradigm for learning from distributed data. To effectively utilize data at different devices without moving them to the cloud, algorithms such as the Federated Averaging (FedAvg) have adopted a "computation then aggregation" (CTA) model.
  arXiv  Detail & Related papers  (2020-05-22T23:07:42Z)
• Post-Estimation Smoothing: A Simple Baseline for Learning with Side Information [102.18616819054368]
  We propose a post-estimation smoothing operator as a fast and effective method for incorporating structural index data into prediction. Because the smoothing step is separate from the original predictor, it applies to a broad class of machine learning tasks. Our experiments on large scale spatial and temporal datasets highlight the speed and accuracy of post-estimation smoothing in practice.
  arXiv  Detail & Related papers  (2020-03-12T18:04:20Z)
• Variational Conditional Dependence Hidden Markov Models for Skeleton-Based Action Recognition [7.9603223299524535]
  This paper revisits conventional sequential modeling approaches, aiming to address the problem of capturing time-varying temporal dependency patterns. We propose a different formulation of HMMs, whereby the dependence on past frames is dynamically inferred from the data. We derive a tractable inference algorithm based on the forward-backward algorithm.
  arXiv  Detail & Related papers  (2020-02-13T23:18:52Z)

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.