{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:32:53Z","timestamp":1772908373706,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540748243","type":"print"},{"value":"9783540748250","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74825-0_18","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T05:42:26Z","timestamp":1187674946000},"page":"195-206","source":"Crossref","is-referenced-by-count":1,"title":["Recurrent Predictive Models for Sequence Segmentation"],"prefix":"10.1007","author":[{"given":"Saara","family":"Hyv\u00f6nen","sequence":"first","affiliation":[]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bellman, R.: On the approximation of curves by line segments using dynamic programming. Communications of the ACM\u00a04(6) (1961)","DOI":"10.1145\/366573.366611"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Secure Data Management","author":"E. Bingham","year":"2006","unstructured":"Bingham, E., et al.: Segmentation and dimensionality reduction. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2006. LNCS, vol.\u00a04165, Springer, Heidelberg (2006)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: FOCS (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"18_CR5","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Gionis, A., Mannila, H.: Finding recurrent sources in sequences. In: RECOMB (2003)","DOI":"10.1145\/640075.640091"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Guha, S., Koudas, N., Shim, K.: Data-streams and histograms. In: STOC (2001)","DOI":"10.1145\/380752.380841"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Gwadera, R., Gionis, A., Mannila, H.: Optimal segmentation using tree models. In: ICDM (2006)","DOI":"10.1109\/ICDM.2006.122"},{"key":"18_CR9","volume-title":"Principles of Data Mining","author":"D. Hand","year":"2001","unstructured":"Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. The MIT Press, Cambridge (2001)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Himberg, J., Korpiaho, K., Mannila, H., Tikanmaki, J., Toivonen, H.: Time series segmentation for context recognition in mobile devices. In: ICDM (2001)","DOI":"10.1109\/ICDM.2001.989520"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1126\/science.1105436","volume":"307","author":"D.A. Hinds","year":"2005","unstructured":"Hinds, D.A., et al.: Wholegenome patterns of common DNA variation in three human populations. Science\u00a0307, 1072\u20131079 (2005)","journal-title":"Science"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BF01581035","volume":"222","author":"D. Hochbaum","year":"1982","unstructured":"Hochbaum, D.: Heuristics for the fixed cost median problem. Mathematical Programming\u00a0222, 148\u2013162 (1982)","journal-title":"Mathematical Programming"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is np-complete. Information Processing Letters\u00a05, 15\u201317 (1976)","journal-title":"Information Processing Letters"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"3345","DOI":"10.5194\/acp-5-3345-2005","volume":"5","author":"S. Hyv\u00f6nen","year":"2005","unstructured":"Hyv\u00f6nen, S., et al.: A look at aerosol formation using data mining techniques. Atmospheric Chemistry and Physics\u00a05, 3345\u20133356 (2005)","journal-title":"Atmospheric Chemistry and Physics"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Keogh, E.J., et al.: Locally adaptive dimensionality reduction for indexing large time series databases. In: SIGMOD (2001)","DOI":"10.1145\/375663.375680"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Bursty and hierarchical structure in streams. In: KDD (2002)","DOI":"10.1145\/775047.775061"},{"key":"18_CR17","unstructured":"Koivisto, M., et al.: An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries. In: PSB (2003)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Li, W.: DNA segmentation as a model selection process. In: RECOMB (2001)","DOI":"10.1145\/369133.369202"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Lin, J.-H., Vitter, J.S.: \u03b5-approximations with minimum packing constraint violation. In: STOC (1992)","DOI":"10.1145\/129712.129787"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/5.18626","volume":"77","author":"L. Rabiner","year":"1989","unstructured":"Rabiner, L.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE\u00a077, 257\u2013286 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Sarawagi, S.: Efficient inference on sequence segmentation models. In: ICML (2006)","DOI":"10.1145\/1143844.1143944"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Terzi, E., Tsaparas, P.: Efficient algorithms for sequence segmentation. In: SDM (2006)","DOI":"10.1137\/1.9781611972764.28"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis VII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74825-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:41:07Z","timestamp":1619505667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74825-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748243","9783540748250"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74825-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}