Consistent selection of the number of change-points via sample-splitting (Q99318): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(7 intermediate revisions by 6 users not shown)
Property / publication date
 
5 May 2020
Timestamp+2020-05-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 May 2020 / rank
 
Normal rank
Property / author
 
Property / author: Changliang Zou / rank
 
Normal rank
Property / author
 
Property / author: Guang-Hui Wang / rank
 
Normal rank
Property / author
 
Property / author: Run-Ze Li / rank
 
Normal rank
Property / title
 
Consistent selection of the number of change-points via sample-splitting (English)
Property / title: Consistent selection of the number of change-points via sample-splitting (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1442.62126 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://projecteuclid.org/euclid.aos/1581930141 / rank
 
Normal rank
Property / review text
 
This paper proposes a unified framework to select the number of change-points in multiple change point models under a unified framework. A general procedure, named CPOSS, selects the number of change-points that minimizes the squared prediction error, which measures the fit of a specified model for a new sample. The sample is divided into one training set and one validation set by the parity of the time order, resulting in a 2-fold cross-validation with order-preserved sample-splitting which is tailored for the change-point problem. Asymptotic consistency is established, ensuring that the resulting estimated number of change-points equals the true one with probability approaching one under mild conditions. Effectiveness of the proposed selection strategy is demonstrated on a variety of numerical experiments, comparing with the BIC or its variants obtained by modifying the loss function and associated penalization term, on an ample range of simulated examples. Models are considered with changes in different aspects such as the location, scale, distribution and regression relationship. The data can be univariate, multivariate or in linear model structure, either independent or correlated. Two real-data examples are also presented. In the first, CPOSS is used to detect changes in the variance of daily returns of the UK FTSE 100 index. In the second, changes in the proportion of the G+C composition of a human chromosome sequence are considered.
Property / review text: This paper proposes a unified framework to select the number of change-points in multiple change point models under a unified framework. A general procedure, named CPOSS, selects the number of change-points that minimizes the squared prediction error, which measures the fit of a specified model for a new sample. The sample is divided into one training set and one validation set by the parity of the time order, resulting in a 2-fold cross-validation with order-preserved sample-splitting which is tailored for the change-point problem. Asymptotic consistency is established, ensuring that the resulting estimated number of change-points equals the true one with probability approaching one under mild conditions. Effectiveness of the proposed selection strategy is demonstrated on a variety of numerical experiments, comparing with the BIC or its variants obtained by modifying the loss function and associated penalization term, on an ample range of simulated examples. Models are considered with changes in different aspects such as the location, scale, distribution and regression relationship. The data can be univariate, multivariate or in linear model structure, either independent or correlated. Two real-data examples are also presented. In the first, CPOSS is used to detect changes in the variance of daily returns of the UK FTSE 100 index. In the second, changes in the proportion of the G+C composition of a human chromosome sequence are considered. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Annibal Parracho Sant'Anna / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62H12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62G10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62P10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62P20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7196545 / rank
 
Normal rank
Property / zbMATH Keywords
 
model selection
Property / zbMATH Keywords: model selection / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple change-point model
Property / zbMATH Keywords: multiple change-point model / rank
 
Normal rank
Property / zbMATH Keywords
 
selection consistency
Property / zbMATH Keywords: selection consistency / rank
 
Normal rank
Property / zbMATH Keywords
 
cross-validation
Property / zbMATH Keywords: cross-validation / rank
 
Normal rank
Property / zbMATH Keywords
 
least-squares
Property / zbMATH Keywords: least-squares / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q98196934 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: wbs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:08, 5 March 2024

scientific article
Language Label Description Also known as
English
Consistent selection of the number of change-points via sample-splitting
scientific article

    Statements

    0 references
    48
    0 references
    1
    0 references
    1 February 2020
    0 references
    5 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Consistent selection of the number of change-points via sample-splitting (English)
    0 references
    This paper proposes a unified framework to select the number of change-points in multiple change point models under a unified framework. A general procedure, named CPOSS, selects the number of change-points that minimizes the squared prediction error, which measures the fit of a specified model for a new sample. The sample is divided into one training set and one validation set by the parity of the time order, resulting in a 2-fold cross-validation with order-preserved sample-splitting which is tailored for the change-point problem. Asymptotic consistency is established, ensuring that the resulting estimated number of change-points equals the true one with probability approaching one under mild conditions. Effectiveness of the proposed selection strategy is demonstrated on a variety of numerical experiments, comparing with the BIC or its variants obtained by modifying the loss function and associated penalization term, on an ample range of simulated examples. Models are considered with changes in different aspects such as the location, scale, distribution and regression relationship. The data can be univariate, multivariate or in linear model structure, either independent or correlated. Two real-data examples are also presented. In the first, CPOSS is used to detect changes in the variance of daily returns of the UK FTSE 100 index. In the second, changes in the proportion of the G+C composition of a human chromosome sequence are considered.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    model selection
    0 references
    multiple change-point model
    0 references
    selection consistency
    0 references
    cross-validation
    0 references
    least-squares
    0 references
    dynamic programming
    0 references
    0 references