A Study of Probability Estimation Techniques for Rule Learning

作者: Johannes Fürnkranz , Jan-Nikolas Sulzmann

DOI:

关键词:

摘要: Rule learning is known for its descriptive and therefore com- prehensible classification models which also yield good class predictions. However, in some application areas, we need probability estimates. For dierent models, such as decision trees, a variety of techniques obtaining estimates have been proposed evaluated. so far, there has no systematic empirical study how these can be adapted to probabilistic rules methods aect the probability-based rankings. In this paper apply several basic estimation membership probabilities rules. We eect shrinkage technique merging with those their generalizations.

参考文章(17)
Bojan Cestnik, Estimating probabilities: a crucial task in machine learning european conference on artificial intelligence. pp. 147- 149 ,(1990)
Foster Provost, Pedro Domingos, Tree Induction for Probability-Based Ranking Machine Learning. ,vol. 52, pp. 199- 215 ,(2003) , 10.1023/A:1024099825458
Johannes Fürnkranz, Bruno Crémilleux, Arno J. Knobbe, Martin Scholz, From Local Patterns to Global Models: The LeGo Approach to Data Mining ,(2008)
César Ferri, Peter A. Flach, José Hernández-Orallo, Improving the AUC of probabilistic estimation trees european conference on machine learning. pp. 121- 132 ,(2003) , 10.1007/978-3-540-39857-8_13
Bin Wang, Harry Zhang, Improving the Ranking Performance of Decision Trees Lecture Notes in Computer Science. pp. 461- 472 ,(2006) , 10.1007/11871842_44
Janez Demšar, Statistical Comparisons of Classifiers over Multiple Data Sets Journal of Machine Learning Research. ,vol. 7, pp. 1- 30 ,(2006)
Mark A. Hall, Ian H. Witten, Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques ,(1999)
Christopher D. Manning, Hinrich Schütze, Foundations of Statistical Natural Language Processing ,(1999)
William W. Cohen, Fast Effective Rule Induction Machine Learning Proceedings 1995. pp. 115- 123 ,(1995) , 10.1016/B978-1-55860-377-6.50023-2