Greedy Segmentation for a Functional Data Sequence
From MaRDI portal
Publication:6165284
DOI10.1080/01621459.2021.1963261MaRDI QIDQ6165284
Yu-Ting Chen, Tzee-Ming Huang, Jeng-Min Chiou
Publication date: 4 July 2023
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Greedy_Segmentation_for_a_Functional_Data_Sequence/15109461
Cites Work
- On optimal multiple changepoint algorithms for large data
- Using penalized contrasts for the change-point problem
- Heteroskedasticity and Autocorrelation Consistent Covariance Matrix Estimation
- Detecting and estimating changes in dependent functional data
- Wild binary segmentation for multiple change-point detection
- Weakly dependent functional data
- Estimation of a change-point in the mean function of functional data
- Estimating the number of change-points via Schwarz' criterion
- Algorithms for the optimal identification of segment neighborhoods
- Weak convergence and empirical processes. With applications to statistics
- Modified dynamic programming approach for offline segmentation of long hydrometeorological time series
- Identifying multiple changes for a functional data sequence with application to freeway traffic segmentation
- Nonparametric maximum likelihood approach to multiple change-point problems
- Multiple changepoint fitting via quasilikelihood, with application to DNA sequence segmentation
- High Dimensional Change Point Estimation via Sparse Projection
- Detecting Changes in the Mean of Functional Observations
- Optimal Detection of Changepoints With a Linear Computational Cost
- Detecting and Dating Structural Breaks in Functional Data Without Dimension Reduction
- Multiple Change-Point Estimation With a Total Variation Penalty
- Circular binary segmentation for the analysis of array-based DNA copy number data
- Dynamic Functional Principal Components
- Detection of Change in the Spatiotemporal Mean Function
