This paper studies the problem of finding similar time series of product sales in transactional data. We argue that finding such similar time series can lead to discovery of interesting and actionable business information such as previously unknown complementary products or substitutes, and hidden supply chain information. However, finding all possible pairs of n time series exhaustively results in O(n2) time complexity. To address this issue, we propose using k-means clustering method to create small clusters of similar time series, and those clusters with very small intra-cluster variability are used to find similar time series. Finally, we demonstrate the utility of our approach to derive interesting results from real-life data.
CITATION STYLE
Tan, S. C., Lau, P. S., & Yu, X. W. (2015). Finding similar time series in sales transaction data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9101, pp. 645–654). Springer Verlag. https://doi.org/10.1007/978-3-319-19066-2_62
Mendeley helps you to discover research relevant for your work.