Optimal decision trees generation from OR-decision tables

Authors:
Costantino Grana;Manuela Montangero;Daniele Borghesani;Rita Cucchiara
Affiliations:
Dipartimento di Ingegneria dell'Informazione, Università degli Studi di Modena e Reggio Emilia;Dipartimento di Ingegneria dell'Informazione, Università degli Studi di Modena e Reggio Emilia;Dipartimento di Ingegneria dell'Informazione, Università degli Studi di Modena e Reggio Emilia;Dipartimento di Ingegneria dell'Informazione, Università degli Studi di Modena e Reggio Emilia
Venue:
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
Year:
2011

Citing 7
Cited 1

Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time

Journal of the ACM (JACM)
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
Optimal conversion of extended-entry decision tables with general cost criteria

Communications of the ACM
The synthetic approach to decision table conversion

Communications of the ACM
A Simple and Efficient Connected Components Labeling Algorithm

ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Fast connected-component labeling

Pattern Recognition
Optimized block-based connected components labeling with decision trees

IEEE Transactions on Image Processing

Optimal decision trees for local image processing algorithms

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a novel dynamic programming algorithm to synthesize an optimal decision tree from OR-decision tables, an extension of standard decision tables, which allow to choose between several alternative actions in the same rule. Experiments are reported, showing the computational time improvements over state of the art implementations of connected components labeling, using this modelling technique.