In this paper, the least square estimator in the problem of multiple change points estimation is studied. Here, the moving-average processes of ALNQD sequence in the mean shifts are discussed. When the number of chang...In this paper, the least square estimator in the problem of multiple change points estimation is studied. Here, the moving-average processes of ALNQD sequence in the mean shifts are discussed. When the number of change points is known, the rate of convergence of change-points estimation is derived. The result is also true for p-mixing, φ-mixing, a-mixing, associated and negatively associated sequences under suitable conditions.展开更多
The Negative Binomial Multiple Change Point Algorithm is a hybrid change detection and estimation approach that works well for overdispersed and equidispersed count data. This simulation study assesses the performance...The Negative Binomial Multiple Change Point Algorithm is a hybrid change detection and estimation approach that works well for overdispersed and equidispersed count data. This simulation study assesses the performance of the NBMCPA under varying sample sizes and locations of true change points. Various performance metrics are calculated based on the change point estimates and used to assess how well the model correctly identifies change points. Errors in estimation of change points are obtained as absolute deviations of known change points from the change points estimated under the algorithm. Algorithm robustness is evaluated through error analysis and visualization techniques including kernel density estimation and computation of metrics such as change point location accuracy, precision, sensitivity and false positive rate. The results show that the model consistently detects change points that are present and does not erroneously detect changes where there are none. Change point location accuracy and precision of the NBMCPA increases with sample size, with best results for medium and large samples. Further model accuracy and precision are highest for changes located in the middle of the dataset compared to changes located in the periphery.展开更多
基金Supported by the National Natural Science Foundation of China（10471126）.
文摘In this paper, the least square estimator in the problem of multiple change points estimation is studied. Here, the moving-average processes of ALNQD sequence in the mean shifts are discussed. When the number of change points is known, the rate of convergence of change-points estimation is derived. The result is also true for p-mixing, φ-mixing, a-mixing, associated and negatively associated sequences under suitable conditions.
文摘The Negative Binomial Multiple Change Point Algorithm is a hybrid change detection and estimation approach that works well for overdispersed and equidispersed count data. This simulation study assesses the performance of the NBMCPA under varying sample sizes and locations of true change points. Various performance metrics are calculated based on the change point estimates and used to assess how well the model correctly identifies change points. Errors in estimation of change points are obtained as absolute deviations of known change points from the change points estimated under the algorithm. Algorithm robustness is evaluated through error analysis and visualization techniques including kernel density estimation and computation of metrics such as change point location accuracy, precision, sensitivity and false positive rate. The results show that the model consistently detects change points that are present and does not erroneously detect changes where there are none. Change point location accuracy and precision of the NBMCPA increases with sample size, with best results for medium and large samples. Further model accuracy and precision are highest for changes located in the middle of the dataset compared to changes located in the periphery.
