A decomposable branch-and-price formulation for optimal classification trees
buir.advisor | Karsu, Özlem | |
buir.co-advisor | Khaniyev, Taghi | |
dc.contributor.author | Yöner, Elif Rana | |
dc.date.accessioned | 2024-08-15T13:58:03Z | |
dc.date.available | 2024-08-15T13:58:03Z | |
dc.date.copyright | 2024-07 | |
dc.date.issued | 2024-07 | |
dc.date.submitted | 2024-08-07 | |
dc.description | Cataloged from PDF version of article. | |
dc.description | Thesis (Master's): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2024. | |
dc.description | Includes bibliographical references (leaves 53-55). | |
dc.description.abstract | Construction of Optimal Classification Trees (OCTs) using mixed-integer programs, is a promising approach as it returns a tree with minimum classification error. Yet solving integer programs to optimality is known to be computationally costly, especially as the size of the instance and the depth of the tree grow, calling for efficient solution methods. Our research presents a new, decomposable model which lends itself to efficient solution algorithms such as Branch-and-Price. We model the classification tree using a “patternbased” formulation, deciding which feature should be used to split data at each branching node of each leaf. Our results are promising, illustrating the potential of decomposition in the domain of binary OCTs. | |
dc.description.provenance | Submitted by İlknur Sarıkaya (ilknur.sarikaya@bilkent.edu.tr) on 2024-08-15T13:58:03Z No. of bitstreams: 1 B162582.pdf: 2316484 bytes, checksum: 4957e57fb55ccd73b62bc477025fadfd (MD5) | en |
dc.description.provenance | Made available in DSpace on 2024-08-15T13:58:03Z (GMT). No. of bitstreams: 1 B162582.pdf: 2316484 bytes, checksum: 4957e57fb55ccd73b62bc477025fadfd (MD5) Previous issue date: 2024-07 | en |
dc.description.statementofresponsibility | by Elif Rana Yöner | |
dc.embargo.release | 2025-02-07 | |
dc.format.extent | xiii, 64 leaves : illustrations, charts ; 30 cm. | |
dc.identifier.itemid | B162582 | |
dc.identifier.uri | https://hdl.handle.net/11693/115743 | |
dc.language.iso | English | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Optimal classification trees | |
dc.subject | Branch-and-price | |
dc.subject | Classification | |
dc.subject | Combinatorial optimization | |
dc.subject | Machine learning | |
dc.subject | Decomposition | |
dc.subject | Mixed- integer programming. | |
dc.title | A decomposable branch-and-price formulation for optimal classification trees | |
dc.title.alternative | En iyi sınıflandırma ağaçlarını bulmak için geliştirilmiş ayrıştırılabilir dal-fiyat formülasyonu | |
dc.type | Thesis | |
thesis.degree.discipline | Industrial Engineering | |
thesis.degree.grantor | Bilkent University | |
thesis.degree.level | Master's | |
thesis.degree.name | MS (Master of Science) |