Sciweavers

23 search results - page 1 / 5
» Properties of the k-norm pruning algorithm for decision tree...
Sort
View
ICPR
2008
IEEE
13 years 12 months ago
Properties of the k-norm pruning algorithm for decision tree classifiers
Mingyu Zhong, Michael Georgiopoulos, Georgios C. A...
ICML
1998
IEEE
14 years 6 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
SGAI
2010
Springer
13 years 3 months ago
Induction of Modular Classification Rules: Using Jmax-pruning
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...
Frederic T. Stahl, Max Bramer
KDD
1995
ACM
216views Data Mining» more  KDD 1995»
13 years 9 months ago
Robust Decision Trees: Removing Outliers from Databases
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
George H. John
ICDE
2009
IEEE
151views Database» more  ICDE 2009»
14 years 7 months ago
Decision Trees for Uncertain Data
Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information, which originates from...
Smith Tsang, Ben Kao, Kevin Y. Yip, Wai-Shing Ho, ...