{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T10:43:13Z","timestamp":1779014593633,"version":"3.51.4"},"reference-count":60,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T00:00:00Z","timestamp":1551744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Temporal information plays a very important role in many analysis tasks, and can be encoded in at least two different ways. It can be modeled by discrete sequences of events as, for example, in the business intelligence domain, with the aim of tracking the evolution of customer behaviors over time. Alternatively, it can be represented by time series, as in the stock market to characterize price histories. In some analysis tasks, temporal information is complemented by other kinds of data, which may be represented by static attributes, e.g., categorical or numerical ones. This paper presents J48SS, a novel decision tree inducer capable of natively mixing static (i.e., numerical and categorical), sequential, and time series data for classification purposes. The novel algorithm is based on the popular C4.5 decision tree learner, and it relies on the concepts of frequent pattern extraction and time series shapelet generation. The algorithm is evaluated on a text classification task in a real business setting, as well as on a selection of public UCR time series datasets. Results show that it is capable of providing competitive classification performances, while generating highly interpretable models and effectively reducing the data preparation effort.<\/jats:p>","DOI":"10.3390\/computers8010021","type":"journal-article","created":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T03:01:23Z","timestamp":1551754883000},"page":"21","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["J48SS: A Novel Decision Tree Approach for the Handling of Sequential and Time Series Data"],"prefix":"10.3390","volume":"8","author":[{"given":"Andrea","family":"Brunello","sequence":"first","affiliation":[{"name":"Department of Mathematics, Computer Science and Physics, University of Udine, Via delle Scienze, 206, 33100 Udine, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Marzano","sequence":"additional","affiliation":[{"name":"R&amp;D Deparment, Gap S.r.l.u., Via Tricesimo, 246, 33100 Udine, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Computer Science and Physics, University of Udine, Via delle Scienze, 206, 33100 Udine, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9221-879X","authenticated-orcid":false,"given":"Guido","family":"Sciavicco","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Ferrara, Via Giuseppe Saragat, 1, 44122 Ferrara, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,5]]},"reference":[{"key":"ref_1","unstructured":"Quinlan, J.R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Brunello, A., Marzano, E., Montanari, A., and Sciavicco, G. (2018, January 4\u20136). J48S: A Sequence Classification Approach to Text Analysis Based on Decision Trees. Proceedings of the International Conference on Information and Software Technologies, Vilnius, Lithuania.","DOI":"10.1007\/978-3-319-99972-2_19"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Brunello, A., Marzano, E., Montanari, A., and Sciavicco, G. (2018, January 20\u201322). A Novel Decision Tree Approach for the Handling of Time Series. Proceedings of the International Conference on Mining Intelligence and Knowledge Exploration, Cluj-Napoca, Romania.","DOI":"10.1007\/978-3-030-05918-7_32"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1108\/BPMJ-02-2015-0018","article-title":"Past, present and future of contact centers: A literature review","volume":"23","author":"Saberi","year":"2017","journal-title":"Bus. Process Manag. J."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Cailliau, F., and Cavet, A. (2013, January 24\u201330). Mining Automatic Speech Transcripts for the Retrieval of Problematic Calls. Proceedings of the Thirteenth International Conference on Intelligent Text Processing and Computational Linguistics (CICLing 2013), Samos, Greece.","DOI":"10.1007\/978-3-642-37256-8_8"},{"key":"ref_6","unstructured":"Garnier-Rizet, M., Adda, G., Cailliau, F., Gauvain, J.L., Guillemin-Lanne, S., Lamel, L., Vanni, S., and Waast-Richard, C. (June, January 26). CallSurf: Automatic Transcription, Indexing and Structuration of Call Center Conversational Speech for Knowledge Extraction and Query by Content. Proceedings of the Sixth International Conference on Language Resources and Evaluation (LREC 2008), Marrakech, Morocco."},{"key":"ref_7","unstructured":"Nerlove, M., Grether, D.M., and Carvalho, J.L. (2014). Analysis of Economic Time Series: A Synthesis, Academic Press."},{"key":"ref_8","first-page":"166","article-title":"A hybrid time series model based on AR-EMD and volatility for medical data forecasting: A case study in the emergency department","volume":"6","author":"Wei","year":"2017","journal-title":"Int. J. Manag. Econ. Soc. Sci. (IJMESS)"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1007\/s00382-016-3446-3","article-title":"Predictability and prediction of persistent cool states of the tropical pacific ocean","volume":"49","author":"Ramesh","year":"2017","journal-title":"Clim. Dyn."},{"key":"ref_10","unstructured":"Chen, Y., Keogh, E., Hu, B., Begum, N., Bagnall, A., Mueen, A., and Batista, G. (2019, February 27). The UCR Time Series Classification Archive. Available online: www.cs.ucr.edu\/eamonn\/timeseriesdata."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TITB.2008.2003323","article-title":"Heartbeat time series classification with support vector machines","volume":"13","author":"Kampouraki","year":"2009","journal-title":"IEEE Trans. Inf. Technol. Biomed."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Karim, F., Majumdar, S., Darabi, H., and Chen, S. (arXiv, 2018). LSTM fully convolutional networks for time series classification, arXiv.","DOI":"10.1109\/ACCESS.2017.2779939"},{"key":"ref_13","first-page":"537","article-title":"Using time-series NDVI to model land cover change: A case study in the Berg river catchment area, Western Cape, South Africa","volume":"9","author":"Adesuyi","year":"2015","journal-title":"Int. J. Environ. Chem. Ecol. Geol. Geophys. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, P., and Leser, U. (2017, January 6\u201310). Fast and Accurate Time Series Classification with WEASEL. Proceedings of the Proceedings of the 2017 ACM Conference on Information and Knowledge Management (CIKM 2017), Singapore.","DOI":"10.1145\/3132847.3132980"},{"key":"ref_15","unstructured":"Frank, E., Hall, M.A., and Witten, I.H. (2016). The WEKA Workbench. Online Appendix for \u201cData Mining: Practical Machine Learning Tools and Techniques\u201d, Morgan Kaufmann Publishers Inc.. [4th ed.]."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/34.589207","article-title":"A comparative analysis of methods for pruning decision trees","volume":"19","author":"Esposito","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_17","first-page":"54","article-title":"A survey of sequential pattern mining","volume":"1","author":"Lin","year":"2017","journal-title":"Data Sci. Pattern Recognit."},{"key":"ref_18","unstructured":"Agrawal, R., and Srikant, R. (1995, January 6\u201310). Mining Sequential Patterns. Proceedings of the Eleventh IEEE International Conference on Data Engineering (ICDE 1995), Taipei, Taiwan."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","article-title":"Mining sequential patterns by pattern-growth: The prefixspan approach","volume":"16","author":"Pei","year":"2004","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"SPADE: An efficient algorithm for mining frequent sequences","volume":"42","author":"Zaki","year":"2001","journal-title":"Mach. Learn."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., and Yiu, T. (2002, January 23\u201326). Sequential Pattern Mining Using a Bitmap Representation. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002), Edmonton, AB, USA.","DOI":"10.1145\/775047.775109"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., and Afshar, R. (2003, January 1\u20133). CloSpan: Mining Closed Sequential Patterns in Large Datasets. Proceedings of the 2003 SIAM International Conference on Data Mining (SIAM 2003), San Francisco, CA, USA.","DOI":"10.1137\/1.9781611972733.15"},{"key":"ref_23","unstructured":"Wang, J., and Han, J. (April, January 30). BIDE: Efficient Mining of Frequent Closed Sequences. Proceedings of the Twentieth IEEE International Conference on Data Engineering (ICDE 2004), Boston, MA, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Gomariz, A., Campos, M., Marin, R., and Goethals, B. (2013, January 14\u201317). ClaSP: An Efficient Algorithm for Mining Frequent Closed Sequences. Proceedings of the Seventeenth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2013), Gold Coast, Australia.","DOI":"10.1007\/978-3-642-37453-1_5"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Gomariz, A., Campos, M., and Thomas, R. (2014, January 13\u201316). Fast Vertical Mining of Sequential Patterns Using Co-Occurrence Information. Proceedings of the Eighteenth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2014), Tainan, Taiwan.","DOI":"10.1007\/978-3-319-06608-0_4"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modeling by shortest data description","volume":"14","author":"Rissanen","year":"1978","journal-title":"Automatica"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Lo, D., Khoo, S.C., and Li, J. (2008, January 24\u201326). Mining and Ranking Generators of Sequential Patterns. Proceedings of the 2008 SIAM International Conference on Data Mining (SIAM 2008), Atlanta, GA, USA.","DOI":"10.1137\/1.9781611972788.51"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Gomariz, A., \u0160ebek, M., and Hlosta, M. (2014, January 1\u20135). VGEN: Fast Vertical Mining of Sequential Generator Patterns. Proceedings of the Sixteenth International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2014), Munich, Germany.","DOI":"10.1007\/978-3-319-10160-6_42"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., and Smith, J.E. (2003). Introduction to Evolutionary Computing, Springer.","DOI":"10.1007\/978-3-662-05094-1"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, I., and Silva, S. (2013, January 3\u20135). Balancing Learning and Overfitting in Genetic Programming with Interleaved Sampling of Training Data. Proceedings of the European Conference on Genetic Programming (EuroGP 2013), Vienna, Austria.","DOI":"10.1007\/978-3-642-37207-0_7"},{"key":"ref_32","unstructured":"Dabhi, V.K., and Chaudhary, S. (arXiv, 2012). A survey on techniques of improving generalization ability of genetic programming solutions, arXiv."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Fitzgerald, J., Azad, R.M.A., and Ryan, C. (2013, January 6\u201310). A Bootstrapping Approach to Reduce Over-fitting in Genetic Programming. Proceedings of the Proceedings of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation (GECCO 2013), Amsterdam, The Netherlands.","DOI":"10.1145\/2464576.2482690"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Gagn\u00e9, C., Schoenauer, M., Parizeau, M., and Tomassini, M. (2006, January 10\u201312). Genetic Programming, Validation Sets, and Parsimony Pressure. Proceedings of the European Conference on Genetic Programming (EuroGP 2006), Budapest, Hungary.","DOI":"10.1007\/11729976_10"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Vanneschi, L., Castelli, M., and Silva, S. (2010, January 7\u201311). Measuring Bloat, Overfitting and Functional Complexity in Genetic Programming. Proceedings of the Twelfth Annual Conference on Genetic and Evolutionary Computation (GECCO 2010), Portland, OR, USA.","DOI":"10.1145\/1830483.1830643"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Lin, J., Keogh, E., Lonardi, S., and Chiu, B. (2003, January 13). A Symbolic Representation of Time Series, With Implications for Streaming Algorithms. Proceedings of the Eight ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (SIGMOD 2003), San Diego, CA, USA.","DOI":"10.1145\/882082.882086"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/s10618-014-0380-z","article-title":"Classification-driven temporal discretization of multivariate time series","volume":"29","author":"Moskovitch","year":"2015","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.jbi.2016.11.006","article-title":"Learning from heterogeneous temporal data in electronic health records","volume":"65","author":"Zhao","year":"2017","journal-title":"J. Biomed. Inform."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Ye, L., and Keogh, E. (July, January 28). Time Series Shapelets: A New Primitive for Data Mining. Proceedings of the Fifteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009), Paris, France.","DOI":"10.1145\/1557019.1557122"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Grabocka, J., Schilling, N., Wistuba, M., and Schmidt-Thieme, L. (2014, January 24\u201327). Learning Time-series Shapelets. Proceedings of the Twentieth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2014), New York, NY, USA.","DOI":"10.1145\/2623330.2623613"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Grabocka, J., Wistuba, M., and Schmidt-Thieme, L. (arXiv, 2015). Scalable discovery of time-series shapelets, arXiv.","DOI":"10.1145\/2623330.2623613"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Hou, L., Kwok, J.T., and Zurada, J.M. (2016, January 12\u201317). Efficient Learning of Timeseries Shapelets. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI 2016), Phoenix, AZ, USA.","DOI":"10.1609\/aaai.v30i1.10178"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1007\/s10618-016-0473-y","article-title":"Generalized random shapelet forests","volume":"30","author":"Karlsson","year":"2016","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Rakthanmanon, T., and Keogh, E. (2013, January 2\u20134). Fast Shapelets: A Scalable Algorithm for Discovering Time Series Shapelets. Proceedings of the 2013 SIAM International Conference on Data Mining (SIAM 2013), Austin, TX, USA.","DOI":"10.1137\/1.9781611972832.74"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Renard, X., Rifqi, M., Erray, W., and Detyniecki, M. (2015, January 19\u201321). Random-Shapelet: An Algorithm for Fast Shapelet Discovery. Proceedings of the 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA 2015), Paris, France.","DOI":"10.1109\/DSAA.2015.7344782"},{"key":"ref_46","unstructured":"Wistuba, M., Grabocka, J., and Schmidt-Thieme, L. (arXiv, 2015). Ultra-fast shapelets for time series classification, arXiv."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Shah, M., Grabocka, J., Schilling, N., Wistuba, M., and Schmidt-Thieme, L. (2016, January 13\u201316). Learning DTW-shapelets for Time-series Classification. Proceedings of the Third IKDD Conference on Data Science (CODS 2016), Pune, India.","DOI":"10.1145\/2888451.2888456"},{"key":"ref_48","first-page":"525","article-title":"Effect of Mahalanobis Distance on Time Series Classification Using Shapelets","volume":"Volume 2","author":"Arathi","year":"2015","journal-title":"Proceedings of the Forty-Ninth Annual Convention of the Computer Society of India (CSI 2015)"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J., and Hsu, C.W. (2007, January 15\u201320). Discriminative Frequent Pattern Analysis for Effective Classification. Proceedings of the Twenty-Third IEEE International Conference on Data Engineering (ICDE 2007), Istanbul, Turkey.","DOI":"10.1109\/ICDE.2007.367917"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Fan, W., Zhang, K., Cheng, H., Gao, J., Yan, X., Han, J., Yu, P., and Verscheure, O. (2008, January 24\u201327). Direct Mining of Discriminative and Essential Frequent Patterns via Model-Based Search Tree. Proceedings of the Fourteenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008), Las Vegas, NV, USA.","DOI":"10.1145\/1401890.1401922"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1109\/34.643896","article-title":"A new criterion in selection and discretization of attributes for the generation of decision trees","volume":"19","author":"Jun","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TSMCC.2011.2157494","article-title":"A survey of evolutionary algorithms for decision-tree induction","volume":"42","author":"Barros","year":"2012","journal-title":"IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.)"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Durillo, J.J., Nebro, A.J., and Alba, E. (2010, January 18\u201323). The jMetal Framework for Multi-Objective Optimization: Design and Architecture. Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010), Barcelona, Spain.","DOI":"10.1109\/CEC.2010.5586354"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high-performance data compression","volume":"17","author":"Welch","year":"1984","journal-title":"Computer"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1287\/msom.5.2.79.16071","article-title":"Telephone call centers: Tutorial, review, and research prospects","volume":"5","author":"Gans","year":"2003","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"ref_56","unstructured":"Povey, D., Ghoshal, A., Boulianne, G., Burget, L., Glembek, O., Goel, N., Hannemann, M., Motlicek, P., Qian, Y., and Schwarz, P. (2011, January 11\u201315). The Kaldi Speech Recognition Toolkit. Proceedings of the IEEE 2011 Workshop on Automatic Speech Recognition and Understanding (ASRU 2011), Honolulu, HI, USA."},{"key":"ref_57","unstructured":"Hall, M.A. (1999). Correlation-Based Feature Selection For Machine Learning. [Ph.D. Thesis, The University of Waikato]."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Shanmugam, R., and Chattamvelli, R. (2016). Statistics for Scientists and Engineers, Wiley-Blackwell. Chapter 4.","DOI":"10.1002\/9781119047063"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/34.709601","article-title":"The Random Subspace Method for Constructing Decision Forests","volume":"20","author":"Ho","year":"1998","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_60","first-page":"20","article-title":"Concurrent Learning of Large-Scale Random Forests","volume":"Volume 227","year":"2011","journal-title":"Frontiers in Artificial Intelligence and Applications"}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/8\/1\/21\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:36:15Z","timestamp":1760186175000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/8\/1\/21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,5]]},"references-count":60,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["computers8010021"],"URL":"https:\/\/doi.org\/10.3390\/computers8010021","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,5]]}}}