1. Similarity Measure Based on Partial Information of Time Series Advisor ： Dr. Hsu Graduate ： You-Cheng Chen Author ： Xiaoming Jin Yuchang Lu Chunyi Shi

2. Motivation Objective Introduction Retrieval and Representation of partial Information System Setup Results and Discussion Conclusions Personal Opinion Outline

3. Motivation A “ good ” similarity measurement is determined by human.

4. Objective To propose a model for the retrieval and representation of the partial information in time series.

5. Introduction The model has three objects: Get the partial information Represent partial information in a compressed form Most similarity model could be applied

6. Retrieval and Representation of Partial Information 3.1 General Description Definition 1: Use a rule F to decompose X into a set of time series

7. 3.1 General Description Definition 2: (1) Segment X into a set of sub-series (2) X ’ jk is the k-th F-based component of sub-series X j Use mapping rule T to map each X’ jk to a value R k (j)

8. 3.1 General Description is the orders of all the representing sequences of interest. Definition 3: where A n is the degree of user ’ s interest to n-th component is portion of partial information of interest

9. 3.1 General Description Definition 4: is the full representing sequence(FRS) of the partial information

10. Definition 5: Given two time series X,Y 3.1 General Description

11. Sum up, a representing model for partial information can be summarized by 3.1 General Description Decomposition method F Representation method T Distance measurement D

12. 3.1 General Description Example 1

13. 3.1 General Description Use F to decompose time series to two components (1) Local fluctuating movement S ’ 1 (2) Global movement S ’ 2 FRS(X)=R 1 and the length of the FRS(X)=200/8

14. 3.2 Practial Method Let H is transform matrix of a given orthonormal discrete transform So T j =H*X j We denote the results of discrete transform of time Series Xj and Yj by DT(Xj)=XT j, DT(Yj)=YT j

15. 3.2 Practial Method The k-th component of X is The k-th representing sequence is Then FRS(X) can be calculated as:

16. Here we use DCT(discrete Cosine transform) in our experiments 3.2 Practial Method

17. 4. System Setup 4.1 Evaluation of Similarity Measurement Based on Partial Information We use hierarchical agglomerative clustering(HAC) to cluster FRSs.

18. 5. Results and Discussion We used historical stock data and only considered the time series of closing price. Step 1: use DCT to decompose time series and to represent partial information. Step 2: E=(E 1, …,E r ) to represent the chosen portion. Step 3: E was used to calculate K and together with A Then FRSs of each time series were generated Step 4: calculating MD and clustering

19. 5. Results and Discussion 11,15,14,10,19,10,14,17,14 3, 3, 3, 3, 2, 4, 4, 5, 5

20. 5. Results and Discussion

21. Conclusions The experimental results could help designing a more effective and more efficient similarity measurement

22. Personal Opinion The similarity measurement can be improved better by increasing the weight of the meaningful component.