Model trees are a special case of regression trees in which linear regression models are constructed in the leaves. Little attention has been paid to model trees in relational learning, mainly because the task of learning linear regression equations in this context involves dealing with non-determinacy of predictive attributes. Whereas existing approaches handle this non-determinacy issue either by selecting a single value or by aggregating over all values, in this paper we present a model tree learning system that combines both. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Vens, C., Ramon, J., & Blockeel, H. (2007). ReMauve: A relational model tree learner. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4455 LNAI, pp. 424–438). Springer Verlag. https://doi.org/10.1007/978-3-540-73847-3_38
Mendeley helps you to discover research relevant for your work.