Reducing statistical time-series problems to binary classification
원문 초록
We show how binary classification methods developed to work on i.i.d. data can be used for solving statistical problems that are seemingly unrelated to classification and concern highly-dependent time series. Specifically, the problems of time-series clustering, homogeneity testing and the three-sample problem are addressed. The algorithms that we construct for solving these problems are based on a new metric between time-series distributions, which can be evaluated using binary classification methods. Universal consistency of the proposed algorithms is proven under most general assumptions. The theoretical results are illustrated with experiments on synthetic and real-world data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Support Vector Machines with Time Series Distance Kernels for Action Classification
LLSF - Learning Label Specific Features for Multi-Label Classifcation
A Joint-Entropy Approach To Time-series Classification
Disjoint-CNN for Multivariate Time Series Classification
Semi-supervised Time Series Classification by Temporal Relation Prediction
Generative Adversarial Minority Oversampling for Spectral-Spatial Hyperspectral Image Classification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.