Lecture Notes in Computer Science
DOI: 10.1007/978-3-540-75549-4_5
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of Time Series Data with Predictive Clustering Trees

Abstract: Abstract. Predictive clustering is a general framework that unifies clustering and prediction. This paper investigates how to apply this framework to cluster time series data. The resulting system, Clus-TS, constructs predictive clustering trees (PCTs) that partition a given set of time series into homogeneous clusters. In addition, PCTs provide a symbolic description of the clusters. We evaluate Clus-TS on time series data from microarray experiments. Each data set records the change over time in the expressi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 21 publications
0
16
0
Order By: Relevance
“…With instantiation of the variance and prototype function the PCTs can handle different types of data, e.g. multiple targets [8] or time series [9]. A detailed description of the PCT framework can be found in [7].…”
Section: Pcts For Hierarchical Multi-label Classificationmentioning
confidence: 99%
“…With instantiation of the variance and prototype function the PCTs can handle different types of data, e.g. multiple targets [8] or time series [9]. A detailed description of the PCT framework can be found in [7].…”
Section: Pcts For Hierarchical Multi-label Classificationmentioning
confidence: 99%
“…A Predictive Clustering Tree (PCT) introduced by Dzeroski et al [12] allows for predicting multiple target variables. Human body shape in a statistical shape space can be represented by multiple variables like PCA coordinates.…”
Section: Related Workmentioning
confidence: 99%
“…At each node, the PCT tries to find the best partition rule using D through minimizing the variations of clustered T . As a result, each leaf node represents a cluster, and the conjunction of the conditions on the path from the root to the leaf forms the induction rule [12].…”
Section: Predictive Clustering Treementioning
confidence: 99%
See 1 more Smart Citation
“…Motif-based Classification. Motifs have been used for sequence classification in biological domain [6,15,8]. This is usually done in two steps: i) first motifs are extracted, then ii) each time series is represented as an attribute vector using motifs so that a classifier like SVM [15], Naive Bayes [8], Decision Tree [6], etc.…”
Section: Related Workmentioning
confidence: 99%