{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:14:45Z","timestamp":1725531285249},"publisher-location":"Dordrecht","reference-count":30,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402096877"},{"type":"electronic","value":"9781402096884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-4020-9688-4_10","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T06:15:15Z","timestamp":1240208115000},"page":"267-297","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for Segmentation of Item-Set Time Series"],"prefix":"10.1007","author":[{"given":"Parvathi","family":"Chundi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Rosenkrantz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/366573.366611","volume":"4","author":"R. Bellman","year":"1961","unstructured":"R. Bellman. On the approximation of curves by line segments using dynamic programming. Commun. ACM, 4(6):284, 1961.","journal-title":"Commun. ACM"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"P. Chundi and D.\u00a0J. Rosenkrantz. Constructing time decompositions for analyzing time-stamped documents. In Proceedings of the 4th SIAM International Conference on Data Mining, pages 57\u201368, Orlando, FL, Apr. 2004.","DOI":"10.1137\/1.9781611972740.6"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"P. Chundi and D.\u00a0J. Rosenkrantz. On lossy time decompositions of time-stamped documents. In Proc. 13th ACM Conference on Information and Knowledge Management (CIKM), pages 437\u2013445, Washington, DC, Nov. 2004.","DOI":"10.1145\/1031171.1031256"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10618-005-0035-1","volume":"13","author":"P. Chundi","year":"2006","unstructured":"P. Chundi and D.\u00a0J. Rosenkrantz. Information preserving time decompositions of time stamped documents. Data Min. Knowl. Discov., 13(1):41\u201365, 2006.","journal-title":"Data Min. Knowl. Discov."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"P. Chundi and D.\u00a0J. Rosenkrantz. Segmentation of time series data. In J. Wang, editor, Encyclopedia of Data Warehousing and Mining. Information Science Reference, Hershey, 2nd edition, pages\u00a01753\u20131758, 2008.","DOI":"10.4018\/978-1-60566-010-3.ch267"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/11546924_50","volume-title":"Proc. 16th International Conference on Database and Expert Systems Applications (DEXA)","author":"P. Chundi","year":"2005","unstructured":"P. Chundi, R. Zhang, and D.\u00a0J. Rosenkrantz. Efficient algorithms for constructing time decompositions of time stamped documents. In K.\u00a0V. Andersen, J.\u00a0K. Debenham, and R. Wagner, editors, Proc. 16th International Conference on Database and Expert Systems Applications (DEXA). Lecture Notes in Computer Science, volume\u00a03588, pages 514\u2013523. Springer, Berlin, 2005."},{"key":"10_CR7","unstructured":"K.\u00a0K.\u00a0S. Chung, L. Hossain, and J. Davis. Exploring sociocentric and egocentric approaches for social network analysis. In Proc. 2nd International Conference on Knowledge Management in Asia Pacific, 2005."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-44816-0_20","volume-title":"Proc. 4th International Symposium on Intelligent Data Analysis","author":"P. Cohen","year":"2001","unstructured":"P. Cohen and N. Adams. An algorithm for segmenting categorical time series into meaningful episodes. In Proc. 4th International Symposium on Intelligent Data Analysis. Lecture Notes in Computer Science, volume\u00a02189, pages 198\u2013207. Springer, Berlin, 2001."},{"key":"10_CR9","first-page":"16","volume-title":"Proc. 4th International Conference on Knowledge Discovery and Data Mining (KDD)","author":"G. Das","year":"1998","unstructured":"G. Das, K. Lin, H. Mannila, G. Renganathan, and P. Smyth. Rule discovery from time series. In Proc. 4th International Conference on Knowledge Discovery and Data Mining (KDD), pages 16\u201322. AAAI Press, Menlo Park, 1998."},{"key":"10_CR10","unstructured":"J. Diesner and K. Carley. Exploration of communication networks from the Enron Email Corpus. In Proc. 2005 Workshop on Link Analysis, Counterterrorism, and Security (held in conjunction with SDM 2005), 2005."},{"key":"10_CR11","unstructured":"Enron, 2005, Enron Email Corpus. http:\/\/www.cs.cmu.edu\/~enron\/ ."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Flanagan, J. Mantyjarvi, and J. Himberg. Unsupervised clustering of symbol strings and context recognition. In Proc. 2nd IEEE International Conference on Data Mining, page 171, 2002.","DOI":"10.1109\/ICDM.2002.1183900"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1083784.1083789","volume":"34","author":"M.\u00a0M. Gaber","year":"2005","unstructured":"M.\u00a0M. Gaber, A. Zaslavsky, and S. Krishnaswamy. Mining data streams: A review. ACM SIGMOD Record, 34(2):18\u201326, 2005.","journal-title":"ACM SIGMOD Record"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"X. Ge, W. Pratt, and P. Smyth. Discovering Chinese words from unsegmented text. In Proc. 22nd International Conference on Research and Development on Information Retrieval (SIGIR), pages 271\u2013272, Berkeley, CA, 1999.","DOI":"10.1145\/312624.313472"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"A. Gionis and H. Mannila. Finding recurrent sources in sequences. In Proc. 7th International Conference on Research in Computational Molecular Biology (RECOMB), pages 123\u2013130, 2003.","DOI":"10.1145\/640075.640091"},{"key":"10_CR16","unstructured":"A. Gionis and H. Mannila. Segmentation algorithms for time series and sequence data. In Tutorial at 5th SIAM International Conference on Data Mining, 2005."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"R. Gwadera, A. Gionis, and H. Mannila. Optimal segmentation using tree models. In Proc. 6th International Conference on Data Mining (ICDM), pages 244\u2013253, 2006.","DOI":"10.1109\/ICDM.2006.122"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"J. Himberg, J. Toivonen, K. Korpiaho, and H. Mannila. Time series segmentation for context recognition in mobile devices. In Proc. 1st International Conference on Data Mining (ICDM), pages 203\u2013210, 2001.","DOI":"10.1109\/ICDM.2001.989520"},{"issue":"8","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1162\/neco.1997.9.8.1691","volume":"9","author":"A. Kehagias","year":"1997","unstructured":"A. Kehagias and V. Petridis. Time-series segmentation using predictive modular neural networks. Neural Computation, 9(8):1691\u20131709, 1997.","journal-title":"Neural Computation"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/A:1024988512476","volume":"7","author":"E.\u00a0J. Keogh","year":"2003","unstructured":"E.\u00a0J. Keogh and S. Kasetty. On the need for time series data mining benchmarks: A survey and empirical demonstration. Data Min. Knowl. Discov., 7(4):349\u2013371, 2003.","journal-title":"Data Min. Knowl. Discov."},{"key":"10_CR21","first-page":"239","volume-title":"Proc. 4th International Conference on Knowledge Discovery and Data Mining (KDD)","author":"E.\u00a0J. Keogh","year":"1998","unstructured":"E.\u00a0J. Keogh and M.\u00a0J. Pazzani. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In Proc. 4th International Conference on Knowledge Discovery and Data Mining (KDD), pages 239\u2013243. AAAI Press, Menlo Park, 1998."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"E.\u00a0J. Keogh, S. Chu, D. Hart, and M.\u00a0J. Pazzani. An online algorithm for segmenting time series. In Proc. 1st IEEE International Conference on Data Mining (ICDM), pages 289\u2013296, 2001.","DOI":"10.1109\/ICDM.2001.989531"},{"key":"10_CR23","unstructured":"B. Klimt and Y. Yang. Introducing the Enron Corpus. In First Conference on Email and Anti-Spam (CEAS), 2004."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"J. Lin, E.\u00a0J. Keogh, S. Lonardi, and B. Chiu. A symbolic representation of time series, with implications for streaming algorithms. In Proc. 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), pages 2\u201311, 2003.","DOI":"10.1145\/882082.882086"},{"issue":"3","key":"10_CR25","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"H. Mannila, H. Toivonen, and A.\u00a0I. Verkamo. Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov., 1(3):259\u2013289, 1997.","journal-title":"Data Min. Knowl. Discov."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"N. Pathak, S. Mane, and J. Srivastava. Who thinks who knows who? Socio-cognitive analysis of Email networks. In Proc. 6th IEEE International Conference on Data Mining (ICDM), pages 466\u2013477, 2006.","DOI":"10.1109\/ICDM.2006.168"},{"key":"10_CR27","first-page":"431","volume":"295","author":"E. Perlman","year":"2003","unstructured":"E. Perlman and A. Java. Predictive mining of time series data in astronomy. Proc. Astronomical Data Analysis Software and Systems XII, ASP Conference Series, 295:431\u2013434, 2003.","journal-title":"Proc. Astronomical Data Analysis Software and Systems XII, ASP Conference Series"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"J. Shetty and J. Adibi. Discovering important nodes through graph entropy \u2013 the case of Enron Email Database. In Workshop on Link Discovery: Issues, Approaches and Applications (held in conjunction with ACM SIGKDD 2005), pages 74\u201381, 2005.","DOI":"10.1145\/1134271.1134282"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"H. Siy, P. Chundi, D.\u00a0J. Rosenkrantz, and M. Subramaniam. Discovering dynamic developer relationships from software version histories by time series segmentation. In Proc. 23rd IEEE International Conference on Software Maintenance (ICSM), pages 415\u2013424, Paris, Oct. 2007.","DOI":"10.1109\/ICSM.2007.4362654"},{"issue":"3","key":"10_CR30","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/smr.368","volume":"20","author":"H. Siy","year":"2008","unstructured":"H. Siy, P. Chundi, D.\u00a0J. Rosenkrantz, and M. Subramaniam. A segmentation-based approach for temporal analysis of software version repositories. J. Software Maintenance and Evolution: Research and Practice, 20(3):199\u2013222, 2008.","journal-title":"J. Software Maintenance and Evolution: Research and Practice"}],"container-title":["Fundamental Problems in Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-9688-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T01:55:35Z","timestamp":1619661335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-9688-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781402096877","9781402096884"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-9688-4_10","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}