Abstract
A variety of methods have been proposed to measure time series similarity, such as Dynamic Time Warping and Edit distance. Although these methods have been shown to be effective and useful in various data mining tasks, they seldom consider task-specific information. Without consideration of task-specific information, the similarity measures may not work quite well on specific tasks. In this paper, we investigate how to learn task-specific time series similarity measures. We adopt metric learning as the principled approach, and we proposed two novel models based on metric learning to evaluate task-specified time series similarity. We construct our test collection based on real data from Renren Games data. Extensive experimental results show that our proposed methods are very effective.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berndt, D.J., Clifford, J.: Using Dynamic Time Warping to Find Patterns in Time Series. In: KDD Workshop (1994)
Vlachos, M., Gunopoulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: Proceedings of the 18th International Conference on Data Engineering, ICDE 2002 (2002)
Chen, L., Özsu, M.T., Oria, V.: Robust and fast similarity search for moving object trajectories. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005 (2005)
Xing, Z., Pei, J., Keogh, E.: A brief survey on sequence classification. SIGKDD Explor. Newsl. 12(1) (November 2010)
Wang, F., Chen, S., Zhang, C., Li, T.: Semi-supervised metric learning by maximizing constraint margin. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008 (2008)
Chen, L., Ng, R.: On the marriage of lp-norms and edit distance. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, vol. 30 (2004)
Korn, F., Jagadish, H.V., Faloutsos, C.: Efficiently supporting ad hoc queries in large datasets of time sequences. SIGMOD Rec. 26(2) (June 1997)
Pong Chan, K., Fu, A.W.C.: Efficient time series matching by wavelets. In: Proceedings of 15th International Conference on Data Engineering, ICDE 1999 (1999)
Wei, L., Keogh, E.: Semi-supervised time series classification. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006 (2006)
Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: A survey and empirical demonstration. Data Min. Knowl. Discov. 7(4) (October 2003)
Nguyen, M.N., Li, X.L., Ng, S.K.: Positive unlabeled learning for time series classification. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI 2011, vol. 2 (2011)
Wang, F., Sun, J., Ebadollahi, S.: Composite distance metric integration by leveraging multiple experts’ inputs and its application in patient similarity assessment. Statistical Analysis and Data Mining 5(1) (2012)
Weinberger, K.Q., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. J. Mach. Learn. Res. 10 (June 2009)
Wang, F.: Semisupervised metric learning by maximizing constraint margin. IEEE Transactions on Systems, Man, and Cybernetics, Part B 41(4), 931–939 (2011)
Korn, F., Jagadish, H.V., Faloutsos, C.: Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. In: ACM SIGMOD, pp. 289–300 (May 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, Y., Zhao, W.X., Yan, H., Li, X. (2013). A Metric Learning Based Approach to Evaluate Task-Specific Time Series Similarity. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-38562-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38561-2
Online ISBN: 978-3-642-38562-9
eBook Packages: Computer ScienceComputer Science (R0)