Ranking with Predictive Clustering Trees
A novel class of applications of predictive clustering trees is addressed, namely ranking. Predictive clustering trees, as implemented in Clus, allow for predicting multiple target variables. This approach makes sense especially if the target variables are not independent of each other. This is typically the case in ranking, where the (relative) performance of several approaches on the same task has to be predicted from a given description of the task. We propose to use predictive clustering trees for ranking. As compared to existing ranking approaches which are instance-based, our approach also allows for an explanation of the predicted rankings. We illustrate our approach on the task of ranking machine learning algorithms, where the (relative) performance of the learning algorithms on a dataset has to be predicted from a given dataset description.
KeywordsRegression Tree Individual Attribute Machine Learning Algorithm Cluster Tree Ranking Tree
- ESPRIT METAL Project (project number 26.357): A Meta-Learning Assistant for Providing User Support in Machine Learning and Data Mining. http://www.metal-kdd.org/.
- H. Bensusan and A. Kalousis. Estimating the predictive accuracy of a classifier. In Proc. of the Twelfth European Conference on Machine Learning, pages 25–36. Springer, Berlin, 2001.Google Scholar
- H. Blockeel, L. De Raedt, and J. Ramon. Top-down induction of clustering trees. In Proc. of the Fifteenth International Conference on Machine Learning, pages 55–63. Morgan Kaufmann, 1998.Google Scholar
- H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon, and H. Vandecasteele. Improving the efficiency of inductive logic programming through the use of query packs. Journal of Artificial Intelligence Research, 2002. In press.Google Scholar
- P. B. Brazdil and R. J. Henery. Analysis of results. In D. Michie, D. J. Spiegelhalter, and C. C. Taylor, editors, Machine learning, neural and statistical classification, pages 98–106. Ellis Horwood, Chichester, 1994.Google Scholar
- A. Kalousis. Algorithm Selection via Meta-Learning. PhD Thesis. University of Geneva, Department of Computer Science, 2002.Google Scholar
- G. Lindner and R. Studer. AST: Support for algorithm selection with a CBR approach. In Proc. of the ICML-99 Workshop on Recent Advances in Meta-Learning and Future Work, pages 38–47. J. Stefan Institute, Ljubljana, Slovenia, 1999.Google Scholar
- B. Pfahringer, H. Bensusan and C. Giraud-Carrier. Meta-Learning by Landmarking Various Learning Algorithms. In Proc. of the Seventeenth International Conference on Machine Learning: 743–750. Morgan Kaufmann, San Francisco, 2000.Google Scholar
- C. Soares and P. B. Brazdil. Zoomed ranking: Selection of classi.cation algorithms based on relevant performance information. In Proc. of the Fourth European Conference on Principles of Data Mining and Knowledge Discovery, pages 126–135. Springer, Berlin, 2000.Google Scholar
- L. Todorovski and S. Dzeroski. Experiments in meta-level learning with ILP. In Proc. of the Third European Conference on Principles of Data Mining and Knowledge Discovery, pages 98–106. Springer, Berlin, 1999.Google Scholar