@article{ITA_1997__31_2_149_0,
author = {Galesi, Nicola},
title = {A syntactic characterization of bounded-rank decision trees in terms of decision lists},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {149--158},
year = {1997},
publisher = {EDP Sciences},
volume = {31},
number = {2},
mrnumber = {1462584},
zbl = {0876.68092},
language = {en},
url = {https://www.numdam.org/item/ITA_1997__31_2_149_0/}
}
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 SP - 149 EP - 158 VL - 31 IS - 2 PB - EDP Sciences UR - https://www.numdam.org/item/ITA_1997__31_2_149_0/ LA - en ID - ITA_1997__31_2_149_0 ER -
%0 Journal Article %A Galesi, Nicola %T A syntactic characterization of bounded-rank decision trees in terms of decision lists %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1997 %P 149-158 %V 31 %N 2 %I EDP Sciences %U https://www.numdam.org/item/ITA_1997__31_2_149_0/ %G en %F ITA_1997__31_2_149_0
Galesi, Nicola. A syntactic characterization of bounded-rank decision trees in terms of decision lists. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 2, pp. 149-158. https://www.numdam.org/item/ITA_1997__31_2_149_0/
1. , Rank-ϒ decision trees are a subclass of ϒ-decision lists, Information Processing Letters, 1992, 42, pp. 183-185. | Zbl | MR
2. and , Learning decision trees from random examples, Information and Computation, 1989, 82, pp. 231-246. | Zbl | MR
3. , Learning decision lists, Machine Learning, 1987, 2, pp. 223-246.





