A syntactic characterization of bounded-rank decision trees in terms of decision lists
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1997)
- Volume: 31, Issue: 2, page 149-158
- ISSN: 0988-3754
Access Full Article
top
How to cite
topGalesi, Nicola. "A syntactic characterization of bounded-rank decision trees in terms of decision lists." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 31.2 (1997): 149-158. <http://eudml.org/doc/92556>.
@article{Galesi1997,
author = {Galesi, Nicola},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {decision lists; bounded rank decision trees},
language = {eng},
number = {2},
pages = {149-158},
publisher = {EDP-Sciences},
title = {A syntactic characterization of bounded-rank decision trees in terms of decision lists},
url = {http://eudml.org/doc/92556},
volume = {31},
year = {1997},
}
TY - JOUR
AU - Galesi, Nicola
TI - A syntactic characterization of bounded-rank decision trees in terms of decision lists
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1997
PB - EDP-Sciences
VL - 31
IS - 2
SP - 149
EP - 158
LA - eng
KW - decision lists; bounded rank decision trees
UR - http://eudml.org/doc/92556
ER -
References
top- 1. A. BLUM, Rank-ϒ decision trees are a subclass of ϒ-decision lists, Information Processing Letters, 1992, 42, pp. 183-185. Zbl0773.68059MR1170878
- 2. A. EHRENFEUCHT and D. HAUSSLER, Learning decision trees from random examples, Information and Computation, 1989, 82, pp. 231-246. Zbl0679.68157MR1016682
- 3. R. L. RIVEST, Learning decision lists, Machine Learning, 1987, 2, pp. 223-246.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.