Abstract
Cost management and completion timelines are common classification problem requirements. For instance, a blood test requires human and equipment resources, costs money, and must be done quickly. To avoid major patient risks, medical diagnosis should minimize positive-to-negative misclassification. There has been extensive research on how to build a decision tree from training data that minimizes misclassification and test costs, but not on how to design an optimal decision tree with time constraints. A mixed-integer programming is implemented to create an optimal time-constrained cost-sensitive decision tree in this study. We adapt several existing approaches in the literature with time constraints, misclassification cost, and feature selection cost, and introduce new mathematical models designed for these problems. Our experiments compare all methods and examine how time and cost constraints affect optimal solution identification and demonstration.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aghaei, S., Gomez, A., Vayanos, P.: Learning optimal classification trees: strong max-flow formulations (2020)
Aglin, G., Nijssen, S., Schaus, P.: Learning optimal decision trees using caching branch-and-bound search. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 04, pp. 3146–3153 (2020)
Bertsimas, D., Dunn, J.: Optimal classification trees. Mach. Learn. 106(7), 1039–1082 (2017)
Chen, Y.L., Wu, C.C., Tang, K.: Building a cost-constrained decision tree with multiple condition attributes. Inf. Sci. 179(7), 967–979 (2009)
Chen, Y.L., Wu, C.C., Tang, K.: Time-constrained cost-sensitive decision tree induction. Inf. Sci. 354, 140–152 (2016)
Firat, M., Crognier, G., Gabor, A.F., Hurkens, C., Zhang, Y.: Column generation based heuristic for learning classification trees. Comput. Oper. Res. 116, 104866 (2020)
Kao, H.P., Tang, K.: Cost-sensitive decision tree induction with label-dependent late constraints. INFORMS J. Comput. 26(2), 238–252 (2014)
Ling, C., Sheng, V., Yang, Q.: Test strategies for cost-sensitive decision trees. IEEE Trans. Knowl. Data Eng. 18(8), 1055–1067 (2006)
Lomax, S., Vadera, S.: A survey of cost-sensitive decision tree induction algorithms. ACM Comput. Surv. 45(16), 1–35 (2013)
Min, F., Hu, Q., Zhu, W.: Feature selection with test cost constraint. Int. J. Approximate Reason. 55(1, Part 2), 167–179 (2014). special issue on Decision-Theoretic Rough Sets
Nijssen, S., Fromont, E.: Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Disc. 21(1), 9–51 (2010)
Pendharkar, P.C.: A misclassification cost risk bound based on hybrid particle swarm optimization heuristic. Expert Syst. Appl. 41(4, Part 1), 1483–1491 (2014)
Pendharkar, P.C.: Linear models for cost-sensitive classification. Expert. Syst. 32(5), 622–636 (2015)
Turney, P.D.: Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. J. Artif. Intell. Res. 2, 369–409 (1995)
Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C., Schaus, P.: Learning optimal decision trees using constraint programming. Constraints 25(3), 226–250 (2020)
Verwer, S., Zhang, Y.: Learning decision trees with flexible constraints and objectives using integer optimization. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 94–103. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59776-8_8
Verwer, S., Zhang, Y.: Learning optimal classification trees using a binary linear program formulation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, pp. 1625–1632 (2019)
Wang, J., Zhao, P., Hoi, S.C.H.: Cost-sensitive online classification. IEEE Trans. Knowl. Data Eng. 26(10), 2425–2438 (2014)
Wu, C., Chen, Y., Tang, K.: Cost-sensitive decision tree with multiple resource constraints. Appl. Intell. 49(10), 3765–3782 (2019)
Yi, W., Lu, M., Liu, Z.: Multi-valued attribute and multi-labeled data decision tree algorithm. Int. J. Mach. Learn. Cybern. 2(2), 67–74 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Pham, H.G., Quang, T.T. (2024). Mixed Integer Linear Programming-Based Methods for the Optimal Time-Constrained Cost-Sensitive Decision Tree. In: Hà, M.H., Zhu, X., Thai, M.T. (eds) Computational Data and Social Networks. CSoNet 2023. Lecture Notes in Computer Science, vol 14479. Springer, Singapore. https://doi.org/10.1007/978-981-97-0669-3_19
Download citation
DOI: https://doi.org/10.1007/978-981-97-0669-3_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0668-6
Online ISBN: 978-981-97-0669-3
eBook Packages: Computer ScienceComputer Science (R0)