| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
An Algorithm for Optimal Partitioning of Data on an Interval | Brad Jackson
; Jeffrey D. Scargle
; David Barnes
; Sundararajan Arabhi
; Alina Alt
; Peter Gioumousis
; Elyus Gwin
; Paungkaew Sangtrakulcharoen
; Linda Tan
; Tun Tao Tsai
; | Date: |
17 Sep 2003 | Subject: | Numerical Analysis; Combinatorics; Computational Engineering, Finance, and Science; Data Structures and Algorithms; Information Theory MSC-class: 65C60 | math.NA astro-ph cs.CE cs.DS cs.IT math.CO | Abstract: | 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^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. | Source: | arXiv, math.NA/0309285 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |