Show filters Hide filters

Refine your search

Publication Year
1-1 out of 1 results
Change view
  • Sort by:
30:32 Weierstraß-Institut für Angewandte Analysis und Stochastik (WIAS), Technische Informationsbibliothek (TIB) German 2017

Modeling decision tree training problems as a Mixed Integer Program (MIP) yields optimal decision trees

The problem of constructing an optimal binary decision tree is known to be NP-complete. Therefore most current implementations base on heuristics where local optimality criteria are used. Our approach optimizes decision trees globally by construction a suitable MIP. In recent years both very high computing power and very efficient branch-and-cut algorithms for solving MIPs make the running time more and more realistic for practical applications. We applied our method for the discrimination of tumor samples into distinct telomere maintenance mechanisms (TMM). Telomeres are at the end of the chromosomes and shorten after each replication serving as a crucial check point for protecting cells from unbound replication. Tumor cells circumvent this by either re-evoking the enzyme for elongation or redirecting DNA-repair mechanisms know as alternative TMM. Our approach allowed classifying the tumor samples with an accuracy of 0.95 when using the experimental gold standard (C-circle assays).
  • Published: 2017
  • Publisher: Weierstraß-Institut für Angewandte Analysis und Stochastik (WIAS), Technische Informationsbibliothek (TIB)
  • Language: German
out of 1 pages
Loading...
Feedback

Timings

   64 ms - page object
   15 ms - search
    1 ms - highlighting
    1 ms - highlighting/21909

Version

AV-Portal 3.8.0 (dec2fe8b0ce2e718d55d6f23ab68f0b2424a1f3f)