{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:28:30Z","timestamp":1742930910464,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819706686"},{"type":"electronic","value":"9789819706693"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0669-3_19","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:20:16Z","timestamp":1709155216000},"page":"198-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mixed Integer Linear Programming-Based Methods for\u00a0the\u00a0Optimal Time-Constrained Cost-Sensitive Decision Tree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8356-3180","authenticated-orcid":false,"given":"Hoang Giang","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toan Tran","family":"Quang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"19_CR1","unstructured":"Aghaei, S., Gomez, A., Vayanos, P.: Learning optimal classification trees: strong max-flow formulations (2020)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"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\u20133153 (2020)","DOI":"10.1609\/aaai.v34i04.5711"},{"issue":"7","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Dunn, J.: Optimal classification trees. Mach. Learn. 106(7), 1039\u20131082 (2017)","journal-title":"Mach. Learn."},{"issue":"7","key":"19_CR4","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.ins.2008.11.032","volume":"179","author":"YL Chen","year":"2009","unstructured":"Chen, Y.L., Wu, C.C., Tang, K.: Building a cost-constrained decision tree with multiple condition attributes. Inf. Sci. 179(7), 967\u2013979 (2009)","journal-title":"Inf. Sci."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ins.2016.03.022","volume":"354","author":"YL Chen","year":"2016","unstructured":"Chen, Y.L., Wu, C.C., Tang, K.: Time-constrained cost-sensitive decision tree induction. Inf. Sci. 354, 140\u2013152 (2016)","journal-title":"Inf. Sci."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"104866","DOI":"10.1016\/j.cor.2019.104866","volume":"116","author":"M Firat","year":"2020","unstructured":"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)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1287\/ijoc.2013.0560","volume":"26","author":"HP Kao","year":"2014","unstructured":"Kao, H.P., Tang, K.: Cost-sensitive decision tree induction with label-dependent late constraints. INFORMS J. Comput. 26(2), 238\u2013252 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"8","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1109\/TKDE.2006.131","volume":"18","author":"C Ling","year":"2006","unstructured":"Ling, C., Sheng, V., Yang, Q.: Test strategies for cost-sensitive decision trees. IEEE Trans. Knowl. Data Eng. 18(8), 1055\u20131067 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"16","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2431211.2431215","volume":"45","author":"S Lomax","year":"2013","unstructured":"Lomax, S., Vadera, S.: A survey of cost-sensitive decision tree induction algorithms. ACM Comput. Surv. 45(16), 1\u201335 (2013)","journal-title":"ACM Comput. Surv."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Min, F., Hu, Q., Zhu, W.: Feature selection with test cost constraint. Int. J. Approximate Reason. 55(1, Part 2), 167\u2013179 (2014). special issue on Decision-Theoretic Rough Sets","DOI":"10.1016\/j.ijar.2013.04.003"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10618-010-0174-x","volume":"21","author":"S Nijssen","year":"2010","unstructured":"Nijssen, S., Fromont, E.: Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Disc. 21(1), 9\u201351 (2010)","journal-title":"Data Min. Knowl. Disc."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Pendharkar, P.C.: A misclassification cost risk bound based on hybrid particle swarm optimization heuristic. Expert Syst. Appl. 41(4, Part 1), 1483\u20131491 (2014)","DOI":"10.1016\/j.eswa.2013.08.045"},{"issue":"5","key":"19_CR13","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1111\/exsy.12114","volume":"32","author":"PC Pendharkar","year":"2015","unstructured":"Pendharkar, P.C.: Linear models for cost-sensitive classification. Expert. Syst. 32(5), 622\u2013636 (2015)","journal-title":"Expert. Syst."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1613\/jair.120","volume":"2","author":"PD Turney","year":"1995","unstructured":"Turney, P.D.: Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. J. Artif. Intell. Res. 2, 369\u2013409 (1995)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s10601-020-09312-3","volume":"25","author":"H Verhaeghe","year":"2020","unstructured":"Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C., Schaus, P.: Learning optimal decision trees using constraint programming. Constraints 25(3), 226\u2013250 (2020)","journal-title":"Constraints"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-59776-8_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Verwer","year":"2017","unstructured":"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\u2013103. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_8"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"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\u20131632 (2019)","DOI":"10.1609\/aaai.v33i01.33011624"},{"issue":"10","key":"19_CR18","doi-asserted-by":"publisher","first-page":"2425","DOI":"10.1109\/TKDE.2013.157","volume":"26","author":"J Wang","year":"2014","unstructured":"Wang, J., Zhao, P., Hoi, S.C.H.: Cost-sensitive online classification. IEEE Trans. Knowl. Data Eng. 26(10), 2425\u20132438 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"19_CR19","doi-asserted-by":"publisher","first-page":"3765","DOI":"10.1007\/s10489-019-01464-x","volume":"49","author":"C Wu","year":"2019","unstructured":"Wu, C., Chen, Y., Tang, K.: Cost-sensitive decision tree with multiple resource constraints. Appl. Intell. 49(10), 3765\u20133782 (2019)","journal-title":"Appl. Intell."},{"issue":"2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s13042-011-0015-2","volume":"2","author":"W Yi","year":"2011","unstructured":"Yi, W., Lu, M., Liu, Z.: Multi-valued attribute and multi-labeled data decision tree algorithm. Int. J. Mach. Learn. Cybern. 2(2), 67\u201374 (2011)","journal-title":"Int. J. Mach. Learn. Cybern."}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0669-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:24:50Z","timestamp":1709155490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0669-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819706686","9789819706693"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0669-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/csonet23\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - 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 (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The four extended abstracts are also included in this proceedings.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}