Temporal Decision Trees or the Lazy ECU Vindicated

Abstract

The automatic generation of diagnostic decision trees from qualitative models is a reasonable compromise between the advantages of using a modelbased approach in technical domains and the constraints imposed by on-board applications. In this paper we extend the approach to deal with temporal information. We introduce a notion of temporal diagnostic decision tree, in which nodes have a temporal label providing temporal constraints on the observations, and we present an algorithm for compiling such trees from a model-based diagnostic system. 1

Cite

Text

Console et al. "Temporal Decision Trees or the Lazy ECU Vindicated." International Joint Conference on Artificial Intelligence, 2001.

Markdown

[Console et al. "Temporal Decision Trees or the Lazy ECU Vindicated." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/console2001ijcai-temporal/)

BibTeX

@inproceedings{console2001ijcai-temporal,
  title     = {{Temporal Decision Trees or the Lazy ECU Vindicated}},
  author    = {Console, Luca and Picardi, Claudia and Dupré, Daniele Theseider},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2001},
  pages     = {545-550},
  url       = {https://mlanthology.org/ijcai/2001/console2001ijcai-temporal/}
}