{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:25:00Z","timestamp":1743009900344,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"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_17","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:20:16Z","timestamp":1709155216000},"page":"174-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Matheuristic for\u00a0Building Cost-Constrained Decision Trees with\u00a0Multiple Condition Attributes"],"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"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"17_CR1","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, pp. 3146\u20133153 (2020)","DOI":"10.1609\/aaai.v34i04.5711"},{"key":"17_CR2","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, 1039\u20131082 (2017)","journal-title":"Mach. Learn."},{"key":"17_CR3","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, 967\u2013979 (2009)","journal-title":"Inf. Sci."},{"key":"17_CR4","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":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07153-4_14-1","volume-title":"Handbook of Heuristics","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Fischetti, M.: Matheuristics. In: Mart\u00ed, R., Panos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 1\u201333. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-07153-4_14-1"},{"key":"17_CR6","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, 238\u2013252 (2014)","journal-title":"INFORMS J. Comput."},{"key":"17_CR7","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. (CSUR) 45, 1\u201335 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"11","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/isre.4.2.111","volume":"4","author":"VS Mookerjee","year":"1993","unstructured":"Mookerjee, V.S., Dos Santos, B.L.: Inductive expert system design: maximizing system value. Inf. Syst. Res. 4, 111\u2013140 (1993)","journal-title":"Inf. Syst. Res."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1287\/ijoc.9.4.385","volume":"9","author":"CK Murphy","year":"1997","unstructured":"Murphy, C.K., Benaroch, M.: Adding value to induced decision trees for time-sensitive data. INFORMS J. Comput. 9, 385\u2013396 (1997)","journal-title":"INFORMS J. Comput."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Pham, H.G.: The mixed-integer linear programming for cost-constrained decision trees with multiple condition attributes. In: 14th IEEE International Conference on Knowledge and Systems Engineering (KSE 2022) (2022)","DOI":"10.1109\/KSE56063.2022.9953778"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.asoc.2016.12.047","volume":"53","author":"C Qiu","year":"2017","unstructured":"Qiu, C., Jiang, L., Li, C.: Randomly selected decision tree for test-cost sensitive learning. Appl. Soft Comput. 53, 27\u201333 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.ejor.2010.05.031","volume":"207","author":"M Souza","year":"2010","unstructured":"Souza, M., Coelho, I., Ribas, S., Santos, H., Merschmann, L.: A hybrid heuristic algorithm for the open-pit-mining operational planning problem. Eur. J. Oper. Res. 207(2), 1041\u20131051 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1613\/jair.120","volume":"2","author":"PD Turney","year":"1994","unstructured":"Turney, P.D.: Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. J. Artif. Intell. Res. 2, 369\u2013409 (1994)","journal-title":"J. Artif. Intell. Res."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Vilas Boas, M.G., Santos, H.G., Merschmann, L.H.D.C., Vanden Berghe, G.: Optimal decision trees for the algorithm selection problem: integer programming based approaches. Int. Trans. Oper. Res. 28(5), 2759\u20132781 (2021)","DOI":"10.1111\/itor.12724"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"3765","DOI":"10.1007\/s10489-019-01464-x","volume":"49","author":"CC Wu","year":"2019","unstructured":"Wu, C.C., Chen, Y.L., Tang, K.: Cost-sensitive decision tree with multiple resource constraints. Appl. Intell. 49, 3765\u20133782 (2019)","journal-title":"Appl. Intell."}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:24:24Z","timestamp":1709155464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0669-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819706686","9789819706693"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0669-3_17","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)"}}]}}