Sciweavers

216 search results - page 9 / 44
» Decision Tree with Better Ranking
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
JMLR
2008
111views more  JMLR 2008»
13 years 9 months ago
Ranking Categorical Features Using Generalization Properties
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
Sivan Sabato, Shai Shalev-Shwartz
ROBOCUP
2004
Springer
111views Robotics» more  ROBOCUP 2004»
14 years 3 months ago
Realtime Object Recognition Using Decision Tree Learning
Abstract. An object recognition process in general is designed as a domain specific, highly specialized task. As the complexity of such a process tends to be rather inestimable, m...
Dirk Wilking, Thomas Röfer
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
14 years 1 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
ICLP
1992
Springer
14 years 1 months ago
Weighted Decision Trees
: Whiledecision tree compilationis a promisingway tocarry out guard tests e ciently, the methods given in the literature do not take into account either the execution characteristi...
Saumya K. Debray, Sampath Kannan, Mukul Paithane