ReMauve: A Relational Model Tree Learner

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.

[1]  Johannes Fürnkranz,et al.  Knowledge Discovery in Databases: PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings , 2006, PKDD.

[2]  Arno J. Knobbe,et al.  Multi-relational Decision Tree Induction , 1999, PKDD.

[3]  Jennifer Neville,et al.  Learning relational probability trees , 2003, KDD '03.

[4]  Stefan Kramer,et al.  Inducing classification and regression trees in first order logic , 2001 .

[5]  Luís Torgo.  Computationally Efficient Linear Regression Trees , 2002 .

[6]  Daphne Koller,et al.  Probabilistic Relational Models , 1999, ILP.

[7]  Gordon Plotkin,et al.  A Note on Inductive Generalization , 2008 .

[8]  Arno J. Knobbe,et al.  Numbers in Multi-relational Data Mining , 2005, PKDD.

[9]  J. R. Quinlan.  Learning With Continuous Classes , 1992 .

[10]  村田 和久.  National Institute of Advanced Industrial Science and Technology, Biomass Technology Research Center, BTL Catalyst Team , 2006 .

[11]  Michelangelo Ceci,et al.  Mining Model Trees: A Multi-relational Approach , 2003, ILP.

[12]  Jennifer Neville,et al.  Avoiding Bias when Aggregating Relational Data with Degree Disparity , 2003, ICML.

[13]  Celine Vens,et al.  A simple regression based heuristic for learning model trees , 2006, Intell. Data Anal..

[14]  Ivan Bratko,et al.  First Order Regression , 1997, Machine Learning.

[15]  David Page,et al.  Multiple Instance Regression , 2001, ICML.

[16]  Arno J. Knobbe,et al.  Involving Aggregate Functions in Multi-relational Search , 2002, PKDD.

[17]  Hendrik Blockeel,et al.  Top-Down Induction of First Order Logical Decision Trees , 1998, AI Commun..

[18]  Michelangelo Ceci,et al.  Top-down induction of model trees with regression and splitting nodes , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Luís Torgo,et al.  Functional Models for Regression Tree Leaves , 1997, ICML.

[20]  Luís Torgo,et al.  Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings , 2005, PKDD.

[21]  Stefan Kramer,et al.  Structural Regression Trees , 1996, AAAI/IAAI, Vol. 1.

[22]  Ashwin Srinivasan,et al.  Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction , 1996, Artif. Intell..

[23]  Jan Komorowski,et al.  Principles of Data Mining and Knowledge Discovery , 2001, Lecture Notes in Computer Science.

[24]  Aram Karalic,et al.  Employing Linear Regression in Regression Tree Leaves , 1992, ECAI.

[25]  Saso Dzeroski,et al.  First order random forests: Learning relational classifiers with complex aggregates , 2006, Machine Learning.

[26]  Celine Vens,et al.  Refining Aggregate Conditions in Relational Learning , 2006, PKDD.