Proceedings of the 2006 SIAM International Conference on Data Mining 2006
DOI: 10.1137/1.9781611972764.33
|View full text |Cite
|
Sign up to set email alerts
|

Segmentation and dimensionality reduction

Abstract: Sequence segmentation and dimensionality reduction have been used as methods for studying high-dimensional sequences -they both reduce the complexity of the representation of the original data. In this paper we study the interplay of these two techniques. We formulate the problem of segmenting a sequence while modeling it with a basis of small size, thus essentially reducing the dimension of the input sequence. We give three different algorithms for this problem: all combine existing methods for sequence segme… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
7
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 35 publications
(30 citation statements)
references
References 18 publications
0
30
0
Order By: Relevance
“…Basically, there are mainly three categories of time series segmentation algorithms using dynamic programming. Firstly, sliding windows [9] top-down [10], and bottom-up [11] strategies. The sliding windows method is a purely implicit segmentation technique.…”
Section: Foundationsmentioning
confidence: 99%
“…Basically, there are mainly three categories of time series segmentation algorithms using dynamic programming. Firstly, sliding windows [9] top-down [10], and bottom-up [11] strategies. The sliding windows method is a purely implicit segmentation technique.…”
Section: Foundationsmentioning
confidence: 99%
“…Basically, there are mainly three categories of time series segmentation algorithms using dynamic programming. Firstly, sliding windows [17] top-down [18], and bottom-up [19] strategies. The sliding windows method is a purely implicit segmentation technique.…”
Section: Time Series Segmentationmentioning
confidence: 99%
“…Some of them have provable approximation bounds [8,18], while others have proved to work very well in practice [5,11,14,13,17]. Variants of the basic SEGMEN-TATION problem have been studied in different contexts, for example [2,7,9]. The main idea in these cases is to find a segmentation of the input sequence into k segments, subject to some constraints imposed on the output representatives.…”
Section: Related Workmentioning
confidence: 99%