{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T11:30:55Z","timestamp":1744198255985},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642045943"},{"type":"electronic","value":"9783642045950"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04595-0_26","type":"book-chapter","created":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T04:38:22Z","timestamp":1254371902000},"page":"209-218","source":"Crossref","is-referenced-by-count":5,"title":["A Non-sequential Representation of Sequential Data for Churn Prediction"],"prefix":"10.1007","author":[{"given":"Mark","family":"Eastwood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdan","family":"Gabrys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Bilmes, J.: A gentle tutorial on the em algorithm and its application to parameter estimation for gaussian mixture and hidden markov models (1997)"},{"issue":"2","key":"26_CR2","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Machine Learning\u00a024(2), 123\u2013140 (1996)","journal-title":"Machine Learning"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.patcog.2005.08.016","volume":"40","author":"Y.-S. Chen","year":"2007","unstructured":"Chen, Y.-S., Hung, Y.-P., Yen, T.-F., Fuh, C.-S.: Fast and versatile algorithm for nearest neighbor search based on a lower bound tree. Pattern Recogn.\u00a040(2), 360\u2013375 (2007)","journal-title":"Pattern Recogn."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-70659-3_2","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"T.G. Dietterich","year":"2002","unstructured":"Dietterich, T.G.: Machine learning for sequential data: A review. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 15\u201330. Springer, Heidelberg (2002)"},{"key":"26_CR5","volume-title":"Pattern Classification","author":"R. Duda","year":"2001","unstructured":"Duda, R., Hart, P., Stork, D.: Pattern Classification. John Wiley and Sons, Chichester (2001)"},{"key":"26_CR6","first-page":"148","volume-title":"Proceedings of the 13th International Conference on Machine Learning","author":"Y. Freund","year":"1996","unstructured":"Freund, Y., Schapire, R.E.: Experiments with a new boosting algorithm. In: Proceedings of the 13th International Conference on Machine Learning, pp. 148\u2013156. Morgan Kaufmann, San Francisco (1996)"},{"key":"26_CR7","unstructured":"Haddon, J., Tiwari, A., Roy, R., Ruta, D.: Churn prediction: Does technology matter (2006)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1509\/jmkr.43.2.276","volume":"XLIII","author":"A. Lemmens","year":"2006","unstructured":"Lemmens, A., Croux, C.: Bagging and boosting classification trees to predict churn. Journal of Marketing Research\u00a0XLIII, 276\u2013286 (2006)","journal-title":"Journal of Marketing Research"},{"key":"26_CR9","unstructured":"Murphy, K.: A hmm toolbox for matlab, \n                    \n                      http:\/\/www.cs.ubc.ca\/~murphyk\/software\/hmm\/hmm.html"},{"key":"26_CR10","volume-title":"C4.5: programs for machine learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11875581_25","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2006","author":"D. Ruta","year":"2006","unstructured":"Ruta, D., Nauck, D., Azvine, B.: K nearest sequence method and its application to churn prediction. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol.\u00a04224, pp. 207\u2013215. Springer, Heidelberg (2006)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0957-4174(02)00030-1","volume":"23","author":"C.-P. Wei","year":"2002","unstructured":"Wei, C.-P., Chiu, I.-T.: Turning telecommunications call details to churn prediction: a data mining approach. Expert Systems with Applications\u00a023, 103\u2013112 (2002)","journal-title":"Expert Systems with Applications"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Yan, L., Miller, D.J., Mozer, M.C., Wolniewicz, R.: Improving prediction of customer behaviour in non-stationary environments. In: Proc. of Int. Joint Conf. on Neural Networks, pp. 2258\u20132263 (2001)","DOI":"10.1109\/IJCNN.2001.938518"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based and Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04595-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T20:56:50Z","timestamp":1552165010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04595-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642045943","9783642045950"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04595-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}