Some Developments in Clustering Analysis on Stochastic Processes
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Covariance-based Dissimilarity Measures Applied to Clustering Wide-sense Stationary Ergodic Processes
We introduce a new unsupervised learning problem: clustering wide-sense stationary ergodic stochastic processes. A covariance-based dissimilarity measure together with asymptotically consistent algorithms is designed for…
ClusteringCluster Analysis on Locally Asymptotically Self-similar Processes with Known Number of Clusters
We conduct cluster analysis on a class of locally asymptotically self-similar stochastic processes, which includes multifractional Brownian motion as a representative. When the true number of clusters is supposed to be k…
ClusteringQuantile Time Series Regression Models Revisited
This article discusses recent developments in the literature of quantile time series models in the cases of stationary and nonstationary underline stochastic processes.
regressionTime SeriesTime Series RegressionInfinitely Stochastic Micro Forecasting
Forecasting costs is now a front burner in empirical economics. We propose an unconventional tool for stochastic prediction of future expenses based on the individual (micro) developments of recorded events. Consider a f…
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments
Many real-world optimization problems occur in environments that change dynamically or involve stochastic components. Evolutionary algorithms and other bio-inspired algorithms have been widely applied to dynamic and stoc…
Evolutionary Algorithms