Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Induction of Qualitative Trees

1Dorian Šuc Contact Information and Ivan BratkoContact Information

(3)  Faculty of Computer and Information Science, University of Ljubljana, TrŽaška 25, 1000 Ljubljana, Slovenia
Abstract
We consider the problem of automatic construction of qualitative models by inductive learning from quantitative examples. We present an algorithm QUIN (QUalitative INduction) that learns qualitative trees from a set of examples described with numerical attributes. At difference with decision trees, the leaves of qualitative trees contain qualitative functional constraints as used in qualitative reasoning. A qualitative tree defines a partition of the attribute space into the areas with common qualitative behaviour of the chosen class variable.
We describe a basic algorithm for induction of qualitative trees, improve it to the heuristic QUIN algorithm, and give experimental evaluation of the algorithms on a set of artificial domains. QUIN has already been used to induce qualitative control strategies in dynamic domains such as controlling a crane or riding a bicycle (described elsewhere) and can be applied to other domains as a general tool for qualitative system identification.

Contact Information 1Dorian Šuc
Email: dorian.suc@fri.uni-lj.si

Contact Information Ivan Bratko
Email: ivan.bratko@fri.uni-lj.si
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.109 • Server: MPWEB26
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)