Sciweavers

143 search results - page 4 / 29
» Lazy Learning for Improving Ranking of Decision Trees
Sort
View
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
14 years 1 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
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...
Liangxiao Jiang, Harry Zhang, Jiang Su
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 7 months ago
Optimal constraint-based decision tree induction from itemset lattices
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...
Siegfried Nijssen, Élisa Fromont
PRICAI
2000
Springer
13 years 11 months ago
The Lumberjack Algorithm for Learning Linked Decision Forests
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...
William T. B. Uther, Manuela M. Veloso
CEC
2010
IEEE
13 years 8 months ago
Improving GP classification performance by injection of decision trees
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 ...
Rikard König, Ulf Johansson, Tuve Löfstr...
ECML
2007
Springer
14 years 1 months ago
Decision Tree Instability and Active Learning
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...
Kenneth Dwyer, Robert Holte