143 search results - page 3 / 29 » Lazy Learning for Improving Ranking of Decision Trees |
KDD
2010
ACM
15 years 1 months ago
2010
ACM
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
ECML
2005
Springer
15 years 2 months ago
2005
Springer
We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that ...
ISSRE
2007
IEEE
14 years 11 months ago
2007
IEEE
Using a specific machine learning technique, this paper proposes a way to identify suspicious statements during debugging. The technique is based on principles similar to Tarantul...
AAAI
2006
14 years 10 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...