Abstract
We propose a special type of time series, which we call an item-set time series, to facilitate the temporal analysis of software version histories, email logs, stock market data, etc. In an item-set time series, each observed data value is a set of discrete items. We formalize the concept of an item-set time series and present efficient algorithms for segmenting a given item-set time series. Segmentation of a time series partitions the time series into a sequence of segments where each segment is constructed by combining consecutive time points of the time series. Each segment is associated with an item set that is computed from the item sets of the time points in that segment, using a function which we call a measure function. We then define a concept called the segment difference, which measures the difference between the item set of a segment and the item sets of the time points in that segment. The segment difference values are required to construct an optimal segmentation of the time series. We describe novel and efficient algorithms to compute segment difference values for each of the measure functions described in the paper. We outline a dynamic programming based scheme to construct an optimal segmentation of the given item-set time series. We use the item-set time series segmentation techniques to analyze the temporal content of three different data sets–Enron email, stock market data, and a synthetic data set. The experimental results show that an optimal segmentation of item-set time series data captures much more temporal content than a segmentation constructed based on the number of time points in each segment, without examining the item set data at the time points, and can be used to analyze different types of temporal data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bellman R (1961) On the approximation of curves by segments using dynamic programming. Commun ACM 4: 384
Chundi P, Rosenkrantz DJ (2004) Constructing time decompositions for analyzing time-stamped documents. In: Proceedings of the 4th SIAM international conference on data mining
Chundi P, Rosenkrantz DJ (2004) On lossy time decompositions of time stamped documents. In: Proceedings of the 13th ACM conference on information and knowledge management
Chundi P, Rosenkrantz DJ (2006) Information preserving time decompositions of time stamped documents. Data Min Knowl Disc J 13(1): 41–65
Chundi P, Rosenkrantz DJ (2008) Segmentation of time series data. In: Wang J (ed) Encyclopedia of data warehousing and mining, 2nd edn. (to appear)
Chundi P, Zhang R, Rosenkrantz DJ (2005) Efficient algorithms for constructing time decompositions of time stamped documents. In: Proceedings of the 16th international conference on database and expert systems applications
Chung KKS, Hossain L, Davis J (2005) Exploring sociocentric and egocentric approaches for social network analysis. In: Proceedings of the 2nd international conference on knowledge management in Asia Pacific
Cohen P, Adams N (2001) An algorithm for segmenting categorical time series into meaningful episodes. In: Proceedings of the 4th international symposium on intelligent data analysis, LNCS 2189
Das G, Lin K, Mannila H, Renganathan G, Smyth P (1998) Rule discovery from time series. In: Proceedings of the 4th international conference on knowledge discovery and data mining. AAAI Press
Diesner J, Carley K (2005) Exploration of communication networks from the Enron Email Corpus. In: 2005 Workshop on link analysis, counterterrorism, and security, SIAM international conference on data mining
Enron (2005) Enron Email Corpus. http://www.cs.cmu.edu/~enron/
Flanagan JA, Mantyjarvi J, Himberg J (2002) Unsupervised clustering of symbol strings and context recognition. In: Proceedings of the 2nd IEEE international conference on data mining
Gaber MM, Zaslavsky A, Krishnaswamy S (2005) In: Mining data streams: a review. ACM SIGMOD Rec 34(2):18–26
Ge X, Pratt W, Smyth P (1999) Discovering Chinese words from unsegmented text. In: Proceedings of the 22nd international conference on research and development on information retrieval
Gionis A, Mannila H (2003) Finding recurrent sources in sequences. In: Proceedings of the 7th international conference on research in computational molecular biology
Gionis A, Mannila H (2005) Segmentation algorithms for time series and sequence data. In: Tutorial at 5th SIAM international conference on data mining
Gwadera R, Gionis A, Mannila H (2006) Optimal segmentation using tree models. In: Proceedings of the 6th international conference on data mining
Himber J, Tikanmaki J, Toivonen H, Korpiaho K, Mannila H (2001) Time series segmentation for context recognition in mobile devices. In: Proceedings of the 1st IEEE international conference on data mining
Kehagias A, Petridis V (1997) Time-series segmentation using predictive modular neural networks. Neural Comput 9(8): 1691–1710
Keogh E, Kasetty S (2003) On the need for time series data mining benchmarks: a survey and empirical demonstration. Data Min Knowl Disc J 7(4): 349–371
Keogh E, Pazzani M (1998) An enhanced representation of time series which allows fast and accurate classification, clustering, and revelance feedback. In: Proceedings of the 4th ACM international conference on knowledge discovery and data mining. AAAI Press
Keogh E, Chu S, Hart D, Pazzani M (2001) An online algorithm for segmenting time series. In: Proceedings of 1st IEEE international conference on data mining
Klimt B, Yang Y (2004) Introducing the Enron Corpus. In: First conference on email and anti-spam (CEAS)
Lin J, Keogh E, Lonardi S, Chiu B (2003) A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD workshop on research issues in data mining and knowledge discovery
Mannila H, Toivonen H, Verkamo AI (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Disc J 1(3): 259–289
Pathak N, Mane S, Srivastava J (2006) Who thinks who knows who? Socio-cognitive analysis of email networks. In: Proceedings of the 6th IEEE international conference on data mining
Perlman E, Java A (2003) Predictive mining of time series data in astronomy. In: Proceedings of astronomical data analysis software and systems XII, ASP conference series, vol 295
Shetty J, Adibi J (2005) Discovering important nodes through graph entropy—the case of Enron email database. In: Workshop on link discovery: issues, approaches and applications, ACM SIGKDD conference on knowledge discovery and data mining
Siy H, Chundi P, Rosenkrantz DJ, Subramaniam M (2007) Discovering dynamic developer relationships from software version histories by time series segmentation. In: Proceedings of the 23rd IEEE international conference on software maintenance
Siy H, Chundi P, Rosenkrantz DJ, Subramaniam M (2008) A segmentation-based approach for temporal analysis of software version repositories. J Softw Maint Evol: Res Pract (to appear)
Author information
Authors and Affiliations
Corresponding author
Additional information
Responsible editor: Eamonn Keogh.
Rights and permissions
About this article
Cite this article
Chundi, P., Rosenkrantz, D.J. Efficient algorithms for segmentation of item-set time series. Data Min Knowl Disc 17, 377–401 (2008). https://doi.org/10.1007/s10618-008-0095-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10618-008-0095-0