{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T04:19:47Z","timestamp":1745381987691,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_1","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T09:00:11Z","timestamp":1353920411000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["Detecting Approximate Periodic Patterns"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Apostolico","sequence":"additional","affiliation":[]},{"given":"Estrella","family":"Eisenberg","sequence":"additional","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Noa","family":"Lewenstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Bagchi, S., Hung, E., Iyengar, A., Vogl, N.G., Wadia, N.: Capacity planning tools for web and grid environments. In: Proc. 1st International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS (2006) ISBN = 1-59593-504-5, article number 25, http:\/\/doi.acm.org\/10.1145\/1190095"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-22300-6_39","volume-title":"Algorithms and Data Structures","author":"B. Gfeller","year":"2011","unstructured":"Gfeller, B.: Finding Longest Approximate Periodic Patterns. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 463\u2013474. Springer, Heidelberg (2011)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: Proc. of the 15th International Conference on Data Engineering (ICDE 1999), pp. 106\u2013115. IEEE Computer Society (1999)","DOI":"10.1109\/ICDE.1999.754913"},{"key":"1_CR4","unstructured":"Ma, S., Hellerstein, J.L.: Mining partially periodic event patterns with unknown periods. In: The 17th International Conference on Data Engineering (ICDE), pp. 205\u2013214. IEEE Computer Society (2001)"},{"key":"1_CR5","unstructured":"Federal Highway\u00a0Administration U.S.\u00a0Department of\u00a0Transportation, Conjestion: a national issue (August 2011), http:\/\/www.ops.fhwa.dot.gov\/aboutus\/opstory.htm"},{"key":"1_CR6","unstructured":"Panteleenko, V.V.: Instantaneous offloading of web server loads, Ph.D. thesis. University of Notre Dame (2002)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Rasheed, F., Alshalalfa, M., Alhajj, R.: Efficient periodicity mining in time series databases using suffix trees. IEEE Transactions on Knowledge and Data Engineering 99(preprints) (2010)","DOI":"10.1109\/TKDE.2010.120"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-01307-2_24","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S. Tanbeer","year":"2009","unstructured":"Tanbeer, S., Ahmed, C., Jeong, B.-S., Lee, Y.-K.: Discovering Periodic-Frequent Patterns in Transactional Databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol.\u00a05476, pp. 242\u2013253. Springer, Heidelberg (2009)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Yang, J., Wang, W., Yu, P.S.: Mining asynchronous periodic patterns in time series data. IEEE Trans. on Knowl. and Data Eng.\u00a0(15), 613\u2013628 (2003)","DOI":"10.1109\/TKDE.2003.1198394"}],"container-title":["Lecture Notes in Computer Science","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T20:38:48Z","timestamp":1745354328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}