The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
An algorithm for optimal partitioning of data on an interval
Open accessAbstract
Many signal processing problems can be solved by maximizing the fitness of a segmented model over all possible partitions of the data interval. This letter describes a simple but powerful algorithm that searches the exponentially large space of partitions of N data points in time O(N/sup 2/). The algorithm is guaranteed to find the exact global optimum, automatically determines the model order (the number of segments), has a convenient real-time mode, can be extended to higher dimensional data spaces, and solves a surprising variety of problems in signal detection and characterization, density estimation, cluster analysis, and classification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
A Bayesian Analysis for Change Point Problems
Barry, D., & Hartigan, J. A. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10594323 · Cited by 716
On the approximation of curves by line segments using dynamic programming
Bellman, R. (1961) · Communications of the ACM · doi:10.1145/366573.366611 · Cited by 444
Scargle, J. D. (1998) · The Astrophysical Journal · doi:10.1086/306064 · Cited by 398
Self-citationAlgorithms for the optimal identification of segment neighborhoods
Auger, I. E., & Lawrence, C. E. (1989) · Bulletin of Mathematical Biology · doi:10.1007/bf02458835 · Cited by 326
Product Partition Models for Change Point Problems
Barry, D., & Hartigan, J. A. (1992) · The Annals of Statistics · doi:10.1214/aos/1176348521 · Cited by 285
Bayesian Clustering and Product Partition Models
Quintana, F. A., & Iglesias, P. L. (2003) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00402 · Cited by 194
Cited by
THE LARGE AREA TELESCOPE ON THE FERMI GAMMA-RAY SPACE TELESCOPE MISSION
Atwood, W. B., Abdo, A. A., Ackermann, M., Althouse, W., Anderson, B., Axelsson, M., Baldini, L., Ballet, J., Band, D. L., Barbiellini, G., et al. (2009) · The Astrophysical Journal · doi:10.1088/0004-637x/697/2/1071 · Cited by 4,198
Self-citationOptimal Detection of Changepoints With a Linear Computational Cost
Killick, R., Fearnhead, P., & Eckley, I. A. (2012) · Journal of the American Statistical Association · doi:10.1080/01621459.2012.737745 · Cited by 2,548
THE SECOND FERMI LARGE AREA TELESCOPE CATALOG OF GAMMA-RAY PULSARS
Abdo, A. A., Ajello, M., Allafort, A., Baldini, L., Ballet, J., Barbiellini, G., Baring, M. G., Bastieri, D., Belfiore, A., Bellazzini, R., et al. (2013) · The Astrophysical Journal Supplement Series · doi:10.1088/0067-0049/208/2/17 · Cited by 832
Self-citationWild binary segmentation for multiple change-point detection
Fryzlewicz, P. (2014) · The Annals of Statistics · doi:10.1214/14-aos1245 · Cited by 566
3FHL: The Third Catalog of Hard Fermi-LAT Sources
Ajello, M., Atwood, W. B., Baldini, L., Ballet, J., Barbiellini, G., Bastieri, D., Bellazzini, R., Bissaldi, E., Blandford, R. D., Bloom, E. D., et al. (2017) · The Astrophysical Journal Supplement Series · doi:10.3847/1538-4365/aa8221 · Cited by 352
Metadata
- Authors
- Jackson, B., Scargle, J. D., Barnes, D., Arabhi, S., Alt, A., Gioumousis, P., Gwin, E., San, P., Tan, L., & Tsai, T. T.
- Venue
- IEEE Signal Processing Letters
- Published
- 2005-02
- Volume
- 12
- Issue
- 2
- Pages
- 105-108
- ISSN
- 1070-9908 (ISSN-L)
- OpenAlex
- W2097880821
- Cited by
- 422
- References
- 7
- FWCI
- 6.53
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An algorithm for optimal partitioning of data on an interval. https://app.cochat.ai/papers/10.1109/lsp.2001.838216
- The paper
- Jackson, B., Scargle, J. D., Barnes, D., Arabhi, S., Alt, A., Gioumousis, P., Gwin, E., San, P., Tan, L., & Tsai, T. T. (2005). An algorithm for optimal partitioning of data on an interval. IEEE Signal Processing Letters. https://doi.org/10.1109/lsp.2001.838216
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.