Some Developments in Clustering Analysis on Stochastic Processes

08/05/2019
by   Qidi Peng, et al.
0

We review some developments on clustering stochastic processes and come with the conclusion that asymptotically consistent clustering algorithms can be obtained when the processes are ergodic and the dissimilarity measure satisfies the triangle inequality. Examples are provided when the processes are distribution ergodic, covariance ergodic and locally asymptotically self-similar, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2018

Clustering Analysis on Locally Asymptotically Self-similar Processes

In this paper, we design algorithms for clustering locally asymptoticall...
research
01/27/2018

Covariance-based Dissimilarity Measures Applied to Clustering Wide-sense Stationary Ergodic Processes

We introduce a new unsupervised learning problem: clustering wide-sense ...
research
05/18/2020

Stable and consistent density-based clustering

We present a consistent approach to density-based clustering, which sati...
research
06/25/2018

Distance covariance for discretized stochastic processes

Given an iid sequence of pairs of stochastic processes on the unit inter...
research
02/27/2019

Adaptation for nonparametric estimators of locally stationary processes

Two adaptive bandwidth selection methods for nonparametric estimators in...
research
10/30/2018

Quickest Detection Of Deviations From Periodic Statistical Behavior

A new class of stochastic processes called independent and periodically ...
research
05/16/2020

Conformal Prediction: a Unified Review of Theory and New Challenges

In this work we provide a review of basic ideas and novel developments a...

Please sign up or login with your details

Forgot password? Click here to reset