國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Asymptotic nonparametric statistical...

Ryabko, Daniil.

Asymptotic nonparametric statistical analysis of stationary time series

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Asymptotic nonparametric statistical analysis of stationary time seriesby Daniil Ryabko.
作者:	Ryabko, Daniil.
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	viii, 77 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Time-series analysis.
電子資源:	https://doi.org/10.1007/978-3-030-12564-6
ISBN:	9783030125646$q(electronic bk.)

Asymptotic nonparametric statistical analysis of stationary time series
Ryabko, Daniil.

Asymptotic nonparametric statistical analysis of stationary time series[electronic resource] /by Daniil Ryabko. - Cham :Springer International Publishing :2019. - viii, 77 p. :ill., digital ;24 cm. - SpringerBriefs in computer science,2191-5768. - SpringerBriefs in computer science..

1 Introduction -- 2 Preliminaries -- 3 Basic inference -- Clustering and change-point problems -- 5 Hypothesis Testing -- 6 Generalizations -- References.

Stationarity is a very general, qualitative assumption, that can be assessed on the basis of application specifics. It is thus a rather attractive assumption to base statistical analysis on, especially for problems for which less general qualitative assumptions, such as independence or finite memory, clearly fail. However, it has long been considered too general to be able to make statistical inference. One of the reasons for this is that rates of convergence, even of frequencies to the mean, are not available under this assumption alone. Recently, it has been shown that, while some natural and simple problems, such as homogeneity, are indeed provably impossible to solve if one only assumes that the data is stationary (or stationary ergodic), many others can be solved with rather simple and intuitive algorithms. The latter include clustering and change point estimation among others. In this volume these results are summarize. The emphasis is on asymptotic consistency, since this the strongest property one can obtain assuming stationarity alone. While for most of the problem for which a solution is found this solution is algorithmically realizable, the main objective in this area of research, the objective which is only partially attained, is to understand what is possible and what is not possible to do for stationary time series. The considered problems include homogeneity testing (the so-called two sample problem), clustering with respect to distribution, clustering with respect to independence, change point estimation, identity testing, and the general problem of composite hypotheses testing. For the latter problem, a topological criterion for the existence of a consistent test is presented. In addition, a number of open problems is presented.

ISBN: 9783030125646$q(electronic bk.)

Standard No.: 10.1007/978-3-030-12564-6doiSubjects--Topical Terms:

181890
Time-series analysis.

LC Class. No.: QA280 / .R93 2019

Dewey Class. No.: 519.55

Asymptotic nonparametric statistical analysis of stationary time series
LDR:02977nmm a2200337 a 4500 001 586690
003 DE-He213
005 20200701224327.0
006 m d
007 cr nn 008maaau
008 210326s2019 sz s 0 eng d
020 $a 9783030125646$q(electronic bk.)
020 $a 9783030125639$q(paper)
024 7 $a 10.1007/978-3-030-12564-6 $2 doi
035 $a 978-3-030-12564-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA280 $b .R93 2019
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 519.55 $2 23
090 $a QA280 $b .R988 2019
100 1 $a Ryabko, Daniil. $3 877176
245 1 0 $a Asymptotic nonparametric statistical analysis of stationary time series $h [electronic resource] / $c by Daniil Ryabko.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a viii, 77 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in computer science, $x 2191-5768
505 0 $a 1 Introduction -- 2 Preliminaries -- 3 Basic inference -- Clustering and change-point problems -- 5 Hypothesis Testing -- 6 Generalizations -- References.
520 $a Stationarity is a very general, qualitative assumption, that can be assessed on the basis of application specifics. It is thus a rather attractive assumption to base statistical analysis on, especially for problems for which less general qualitative assumptions, such as independence or finite memory, clearly fail. However, it has long been considered too general to be able to make statistical inference. One of the reasons for this is that rates of convergence, even of frequencies to the mean, are not available under this assumption alone. Recently, it has been shown that, while some natural and simple problems, such as homogeneity, are indeed provably impossible to solve if one only assumes that the data is stationary (or stationary ergodic), many others can be solved with rather simple and intuitive algorithms. The latter include clustering and change point estimation among others. In this volume these results are summarize. The emphasis is on asymptotic consistency, since this the strongest property one can obtain assuming stationarity alone. While for most of the problem for which a solution is found this solution is algorithmically realizable, the main objective in this area of research, the objective which is only partially attained, is to understand what is possible and what is not possible to do for stationary time series. The considered problems include homogeneity testing (the so-called two sample problem), clustering with respect to distribution, clustering with respect to independence, change point estimation, identity testing, and the general problem of composite hypotheses testing. For the latter problem, a topological criterion for the existence of a consistent test is presented. In addition, a number of open problems is presented.
650 0 $a Time-series analysis. $3 181890
650 1 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Coding and Information Theory. $3 273763
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in computer science. $3 559641
856 4 0 $u https://doi.org/10.1007/978-3-030-12564-6
950 $a Computer Science (SpringerNature-11645)