143 search results - page 4 / 29 » Lazy Learning for Improving Ranking of Decision Trees |
153
click to vote
ADMA
2005
Springer
15 years 11 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
188
click to vote
DATAMINE
2010
15 years 6 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
146
click to vote
PRICAI
2000
Springer
15 years 9 months ago
2000
Springer
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
167
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper presents a novel hybrid method combining genetic programming and decision tree learning. The method starts by estimating a benchmark level of reasonable accuracy, based ...
160
click to vote
ECML
2007
Springer
16 years 5 days ago
2007
Springer
Decision tree learning algorithms produce accurate models that can be interpreted by domain experts. However, these algorithms are known to be unstable – they can produce drastic...