{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T07:11:43Z","timestamp":1756192303899,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319999715"},{"type":"electronic","value":"9783319999722"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99972-2_19","type":"book-chapter","created":{"date-parts":[[2018,8,28]],"date-time":"2018-08-28T06:14:23Z","timestamp":1535436863000},"page":"240-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["J48S: A Sequence Classification Approach to Text Analysis Based on Decision Trees"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Brunello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Marzano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sciavicco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,29]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1108\/BPMJ-02-2015-0018","volume":"23","author":"M Saberi","year":"2017","unstructured":"Saberi, M., Khadeer Hussain, O., Chang, E.: Past, present and future of contact centers: a literature review. Bus. Process. Manag. J. 23(3), 574\u2013597 (2017)","journal-title":"Bus. Process. Manag. J."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-37256-8_8","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"F Cailliau","year":"2013","unstructured":"Cailliau, F., Cavet, A.: Mining automatic speech transcripts for\u00a0the\u00a0retrieval of\u00a0problematic calls. In: Gelbukh, A. (ed.) CICLing 2013. LNCS, vol. 7817, pp. 83\u201395. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37256-8_8"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Pandharipande, M.A., Kopparapu, S.K.: A novel approach to identify problematic call center conversations. In: Ninth International Joint Conference on Computer Science and Software Engineering (JCSSE 2012), pp. 1\u20135 (2012)","DOI":"10.1109\/JCSSE.2012.6261805"},{"key":"19_CR4","unstructured":"Garnier-Rizet, M., et al.: CallSurf: automatic transcription, indexing and structuration of call center conversational speech for knowledge extraction and query by content. In: Sixth International Conference on Language Resources and Evaluation (LREC 2008), pp. 2623\u20132628 (2008)"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-7373(87)80053-6","volume":"27","author":"JR Quinlan","year":"1987","unstructured":"Quinlan, J.R.: Simplifying decision trees. Int. J. Man Mach. Stud. 27(3), 221\u2013234 (1987)","journal-title":"Int. J. Man Mach. Stud."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-319-10160-6_42","volume-title":"Data Warehousing and Knowledge Discovery","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., \u0160ebek, M., Hlosta, M.: VGEN: fast vertical mining of sequential generator patterns. In: Bellatreche, L., Mohania, M.K. (eds.) DaWaK 2014. LNCS, vol. 8646, pp. 476\u2013488. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10160-6_42"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/msom.5.2.79.16071","volume":"5","author":"N Gans","year":"2003","unstructured":"Gans, N., Koole, G., Mandelbaum, A.: Telephone call centers: tutorial, review, and research prospects. Manuf. Serv. Oper. Manag. 5(2), 79\u2013141 (2003)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Fan, W., et al.: Direct mining of discriminative and essential frequent patterns via model-based search tree. In: Fourteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008), pp. 230\u2013238 (2008)","DOI":"10.1145\/1401890.1401922"},{"key":"19_CR9","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"IH Witten","year":"2016","unstructured":"Witten, I.H., Frank, E., Hall, M.A., Pal, C.J.: Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, San Francisco (2016)"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1613\/jair.279","volume":"4","author":"JR Quinlan","year":"1996","unstructured":"Quinlan, J.R.: Improved use of continuous attributes in C4.5. J. Artif. Intell. Res. 4(1), 77\u201390 (1996)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824795.1824798","volume":"43","author":"NR Mabroukeh","year":"2010","unstructured":"Mabroukeh, N.R., Ezeife, C.I.: A taxonomy of sequential pattern mining algorithms. ACM Comput. Surv. 43(1), 1\u201341 (2010)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"19_CR12","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger, P., Lin, J.C.W., Kiran, R.U., Koh, Y.S., Thomas, R.: A survey of sequential pattern mining. Data Sci. Pattern Recognit. 1(1), 54\u201377 (2017)","journal-title":"Data Sci. Pattern Recognit."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Eleventh IEEE International Conference on Data Engineering (ICDE 1995), pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"issue":"11","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei, J., et al.: Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans. Knowl. Data Eng. 16(11), 1424\u20131440 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M.J.: Spade: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1), 31\u201360 (2001)","journal-title":"Mach. Learn."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002), pp. 429\u2013435 (2002)","DOI":"10.1145\/775047.775109"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/1.9781611972733.15","volume-title":"Proceedings of the 2003 SIAM International Conference on Data Mining","author":"Xifeng Yan","year":"2003","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: mining closed sequential patterns in large datasets. In: 2003 SIAM International Conference on Data Mining (SIAM 2003), pp. 166\u2013177 (2003)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J.: BIDE: efficient mining of frequent closed sequences. In: Twentieth IEEE International Conference on Data Engineering (ICDE 2004), pp. 79\u201390 (2004)","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-37453-1_5","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A Gomariz","year":"2013","unstructured":"Gomariz, A., Campos, M., Marin, R., Goethals, B.: ClaSP: an efficient algorithm for mining frequent closed sequences. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS, vol. 7818, pp. 50\u201361. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37453-1_5"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-06608-0_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., Campos, M., Thomas, R.: Fast vertical mining of sequential patterns using co-occurrence information. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS, vol. 8443, pp. 40\u201352. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-06608-0_4"},{"issue":"5","key":"19_CR21","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/1.9781611972788.51","volume-title":"Proceedings of the 2008 SIAM International Conference on Data Mining","author":"David Lo","year":"2008","unstructured":"Lo, D., Khoo, S.C., Li, J.: Mining and ranking generators of sequential patterns. In: 2008 SIAM International Conference on Data Mining (SIAM 2008), pp. 553\u2013564 (2008)"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.engappai.2017.09.024","volume":"67","author":"H Duong","year":"2018","unstructured":"Duong, H., Truong, T., Le, B.: Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions. Eng. Appl. Artif. Intell. 67, 197\u2013210 (2018)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J., Hsu, C.W.: Discriminative frequent pattern analysis for effective classification. In: Twenty-Third IEEE International Conference on Data Engineering (ICDE 2007), pp. 716\u2013725 (2007)","DOI":"10.1109\/ICDE.2007.367917"},{"issue":"12","key":"19_CR25","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1109\/34.643896","volume":"19","author":"BH Jun","year":"1997","unstructured":"Jun, B.H., Kim, C.S., Song, H.Y., Kim, J.: A new criterion in selection and discretization of attributes for the generation of decision trees. IEEE Trans. Pattern Anal. Mach. Intell. 19(12), 1371\u20131375 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR26","unstructured":"Povey, D., et al.: The Kaldi speech recognition toolkit. In: IEEE 2011 Workshop on Automatic Speech Recognition and Understanding (ASRU 2011), pp. 1\u20134 (2011)"},{"key":"19_CR27","unstructured":"Hall, M.A.: Correlation-based feature selection for machine learning. Ph.D. thesis, The University of Waikato (1999)"}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99972-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T07:53:57Z","timestamp":1539762837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99972-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319999715","9783319999722"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99972-2_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Software Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icist2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icist.if.ktu.lt\/index.php\/ICIST","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Open Journal System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"124","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}