miscellaneous-4

Sequential Correlation Estimation

3260 papers • 126 benchmarks • 313 datasets

This task has no description! Would you like to contribute one?

(Image credit: Papersgraph)

Benchmarks

These leaderboards are used to track progress in sequential-correlation-estimation-4

Trend

Dataset

Best Model

Actions

No benchmarks available.

Libraries

i

Use these libraries to find sequential-correlation-estimation-4 models and implementations

Datasets

No datasets available.

Subtasks

No subtasks available.

Most implemented papers

Sequential estimation of Spearman rank correlation using Hermite series estimators

Michael Stephanou, Melvin M. Varughese•Thu Dec 10 2020

A new Hermite series based sequential estimator for the Spearman rank correlation coefficient is described and an exponentially weighted estimator is introduced, which allows the local nonparametric correlation of a bivariate data stream to be tracked.

27

Content

0

Paper Graph

CORAD: Correlation-Aware Compression of Massive Time Series using Sparse Dictionary Coding

P. Cudré-Mauroux, Abdelouahab Khelifati, Mourad Khayati•Sat Nov 30 2019

Time series streams are ubiquitous in many application domains, e.g., transportation, network monitoring, autonomous vehicles, or the Internet of Things (IoT). Transmitting and storing large amounts of such fine-grained data is however expensive, which makes compression schemes necessary in practice. Time series streams that are transmitted together often share properties or evolve together, making them significantly correlated. Despite the rich literature on compression methods, the state-of-the-art approaches do not typically avail correlation information when compressing times series. In this work, we demonstrate how one can leverage the correlation across several related time series streams to both drastically improve the compression efficiency and reduce the accuracy loss.We present a novel compression algorithm for time series streams called CORAD (CORelation-Aware compression of time series streams based on sparse Dictionary coding). Based on sparse dictionary learning, CORAD has the unique ability to exploit the correlation across multiple related time series to eliminate redundancy and perform a more efficient compression. To ensure the accuracy of the compressed time series, we further introduce a method to threshold the information loss of the compression. Extensive validation on real-world datasets shows that CORAD drastically outperforms state-of-the-art approaches achieving up to 40:1 compression ratios while minimizing the information loss.

27 0

Paper Graph

An Online Algorithm for Nonparametric Correlations

Wei Xiao•Mon Dec 04 2017

This paper proposes a novel online algorithm that can compute the nonparametric correlations 10 to 1,000 times faster than the corresponding batch algorithm, and it can compute them based either on all past observations or on fixed-size sliding windows.

10 0

Paper Graph

Adding a benchmark result helps the community track progress.