Parallel construction of decision trees with consistently non‐increasing expected number of tests

Irad Ben‐Gal and Chavazelet Trister

Applied Stochastic Models in Business and Industry, 2015, vol. 31, issue 1, 64-78

Abstract: In recent years, with the emergence of big data and online Internet applications, the ability to classify huge amounts of objects in a short time has become extremely important. Such a challenge can be achieved by constructing decision trees (DTs) with a low expected number of tests (ENT). We address this challenge by proposing the ‘save favorable general optimal testing algorithm’ (SF‐GOTA) that guarantees, unlike conventional look‐ahead DT algorithms, the construction of DTs with monotonic non‐increasing ENT. The proposed algorithm has a lower complexity in comparison to conventional look‐ahead algorithms. It can utilize parallel processing to reduce the execution time when needed. Several numerical studies exemplify how the proposed SF‐GOTA generates efficient DTs faster than standard look‐ahead algorithms, while converging to a DT with a minimum ENT.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/asmb.2086

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:apsmbi:v:31:y:2015:i:1:p:64-78

Access Statistics for this article

More articles in Applied Stochastic Models in Business and Industry from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().